#include <iostream>
#include <fstream>
#include <algorithm>
#define MAXN 500001
#define INFILE "algsort.in"
#define OUTFILE "algsort.out"
using namespace std;
ifstream f(INFILE);
ofstream g(OUTFILE);
int n,v[MAXN];
int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];
    make_heap(v+1,v+n+1);
    sort_heap(v+1,v+n+1);
    for(int i=1;i<=n;i++)
        g<<v[i]<<" ";
    f.close();
    g.close();
    return 0;
}