#include <cstdio>
        #include <cstring>
        #include <cmath>
        using namespace std;
        int a[500001];
        void swap (int i, int  j)
        {
            int x;
            x=a[i]; a[i]=a[j]; a[j]=x;
        }
        int main()
        {
            int n, i;
            freopen("algsort.in","r",stdin);
            freopen("algsort.out","w",stdout);
            scanf("%d",&n);
            for (i=1; i<=n; i++)
            {
                scanf("%d",&a[i]); bool ok=false; int x=i;
                while (ok==false)
                {
                    if (a[i/2]>=a[i]) {swap(i/2,i); i=i/2;}
                    else ok=true;
                } i=x;
            } int x;
            for (i=1; pow(2,i*1.0)<=n; i++)
            {
                x=pow(2,i*1.0);
                if (a[x]>a[x+1]) swap(x,x+1);
            }
            for (i=1; i<=n; i++) printf("%d ",a[i]);
            fclose(stdin);
            fclose(stdout);
            return 0;
        }