#include<algorithm>

#include<iostream>

#include<cstdio>

using namespace std;

int n,a[];

int init()

{

    int x=;char c=getchar();

    while(c<''||c>'') c=getchar();

    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}

    return x;

}

void heapify(int t)

{

    int left=t*,right=t*+;

    int minn=t;//

    if(left<=n) {minn=a[minn]<a[left] ? minn:left;}

    if(right<=n){minn=a[minn]<a[right] ? minn:right;}

    if(minn!=t)

    {

        swap(a[minn],a[t]);

        heapify(minn);

    }

}

void build()

{

    for(int i=n/;i;i--)

    heapify(i);

}

int get()

{

    int top=a[];

    a[]=a[n];

    n--;

    heapify();

    return top;

}

int main()

{

    n=init();

    for(int i=;i<=n;i++) a[i]=init();

    build();

    while(n)  printf("%d ",get());

}