#include<algorithm>
#include<cstdio>
#include<fstream>
using namespace std;
int main()
{
    int n, v[500002], i;
    ifstream fin("algsort.in");
    freopen("algsort.out", "w", stdout);
    fin>>n;
    for(i=1;i<=n;++i)
        fin>>v[i];
    make_heap(v+1, v+n+1);
    sort_heap(v+1, v+n+1);
    for(i=1;i<=n;++i)
        printf("%d ", v[i]);
    printf("\n");
    return 0;
}