#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,v[500003],c,p,aux;
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(v[c]>v[p]&&p!=0){
            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;
            }
            else{
                break;
            }
            p=c;
            c=c*2;
        }
    }
    for(i=1;i<=n;i++){
        fout<<v[i]<<" ";
    }
    return 0;
}