#include <fstream>

using namespace std;

int h[700000], n;

void comb_heap(int p, int n)
{
    int v = h[p], tata = p, fiu = 2 * p;
    while(fiu <= n){
        if(fiu < n && h[fiu] < h[fiu+1])
            ++fiu;
        if(v < h[fiu]){
            h[tata] = h[fiu];
            tata = fiu;
            fiu *= 2;
        }else fiu = n+1;
    }
    h[tata] = v;
}

int main()
{
    ifstream fin ("algsort.in");
    ofstream fout ("algsort.out");
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> h[i];

    /* MAKING A HEAP WOOP WOOP */
    for (int i = n/2; i; --i)
        comb_heap(i, n);
    /* MAKING A HEAP WOOP WOOP */
    for (int i = n; i > 1; --i){
        int aux = h[1];
        h[1] = h[i];
        h[i] = aux;
        comb_heap(1, i-1);
    }
    for (int i = 1; i <= n; ++i)
        fout << h[i] << " ";
    fin.close();
    fout.close();
    return 0;
}