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