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