#include <iostream>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
#include <algorithm>
int main()
{
    int n;
    in>>n;
    int v[n]i;
    for(i=0;i<n;i++)
        in>>v[i];
    make_heap(v,v+n);

    //push_heap(v,v+n);
    sort_heap(v,v+n);
    /*make_heap(v,v+n);
    while(n)
    {
        pop_heap(v,v+n);
        a[--i] = v[n-1];
        n--;
    }*/
    for(i=0;i<n;i++)
        out<<v[i]<<" ";
    return 0;
}