#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int n,v[500005];

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    for(int i=2;i<=n;i++)
    {
        int j=i;
        while(v[j]>v[j/2] && j!=1)
        {
            swap(v[j],v[j/2]);
            j/=2;
        }
    }

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

    }
    for(int i=1;i<=n;i++)
    {
        fout<<v[i]<<" ";
    }
}