#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,c,p,k;
int v[500001],H[500001];

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

int main(){
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    Heap();
    for(i=1;i<=n;i++)
        fout<<v[i]<<" ";
    return 0;
}