#include <fstream>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500001],n,c,p;

int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];

    for(int i=2;i<=n;i++){
        c=i;
        p=i/2;
        while (p>=1 && v[c]>v[p]){
            swap(v[c],v[p]);
            c=p;
            p=p/2;
        }
    }

    for(int i=n;i>=2;i--){
        swap(v[1],v[i]);
        p=1;
        c=2;
        while(c<=i-1){
            if(c+1<=i-1 && v[c+1]>v[c])
                c++;
            if(v[p]<v[c]){
                swap(v[p],v[c]);
                p=c;
                c=c*2;
            }else break;
        }
    }

    for(int i=1;i<=n;i++)
        g<<v[i]<<" ";

    return 0;
}