#include <fstream>
using namespace std;
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
int n,c,p,v[500010],aux,i;
int main () {
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    for(i=2;i<=n;i++){
        c=i;
        p=i/2;
        while(p>=1 && v[c]>v[p]){
            aux=v[c];
            v[c]=v[p];
            v[p]=aux;
            c=p;
            p=p/2;
        }
    }
    for(i=n;i>=2;i--){
        aux=v[1];
        v[1]=v[i];
        v[i]=aux;
        p=1;
        c=2;
        while(c<=i-1){
            if(c+1<=i-1 && v[c+1]>=v[c])
                c++;
            if(v[p]<v[c]){
                aux=v[p];
                v[p]=v[c];
                v[c]=aux;
                p=c;
                c*=2;
            }
            else
                break;
        }
    }
    for(i=1;i<=n;i++)
        fout<<v[i]<<" ";
}