#include <cstdio>
#include <algorithm>
using namespace std;
long long n,a[550001],i,x,nn;
void heapup(int n)
{
    if (n<=1)  return ;
    if (a[n/2]<a[n])
    {
        swap(a[n/2],a[n]);
        heapup(n/2);
    }
}
void heapdown(int n,int r)
{
    int st,dr;
    if (2*r<=n)
    {
        st=a[2*r];
        if (2*r+1<=n)dr=a[2*r+1];
        else dr=0;
        if (st>dr)
        {
            if (a[2*r]>a[r])
            {
                swap(a[2*r],a[r]);
                heapdown(n,2*r);
            }
        }
        else
        {
            if (a[2*r+1]>a[r])
            {
                swap(a[2*r+1],a[r]);
                heapdown(n,2*r+1);
            }
        }
    }
}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d ",&n);
    for (i=1; i<=n; i++)
    {
        scanf("%d",&x);
        a[i]=x;
        heapup(i);
    }
    nn=n;
    while (n!=0)
    {
        swap (a[1],a[n]);
        n--;
        heapdown(n,1);

    }
    for (i=1; i<=nn; i++)
        printf("%d ",a[i]);
    return 0;
}