#include <bits/stdc++.h>
#define NMAX 500001
using namespace std;

ifstream f ("algsort.in");
ofstream g ("algsort.out");

FILE *fin = fopen("algsort.in","r");
FILE *fout = fopen("algsort.out","w");

int v[NMAX],n;

int pivot(int st,int dr)
{
    swap(v[st],v[st + (dr - st)/2]);
    int d = 0;
    while(st < dr)
    {
        if(v[st] > v[dr])swap(v[st],v[dr]),d=1-d;
        st+=d;
        dr-= 1-d;
    }
    return st;
}

void quicksort(int st,int dr)
{
    if(st < dr)
    {
        int p = pivot(st,dr);
        quicksort(st,p-1);
        quicksort(p+1,dr);
    }
}

int imin(int nod,int k)
{
    if(nod*2+1 > k)return nod * 2;
    else
        if(v[nod*2+1] > v[nod*2])return nod*2;
        else return nod*2+1;
}

void cernere(int nod,int k)
{
    if(nod <= k/2)
    {
        int i = imin(nod,k);
        if(v[nod] > v[i])
        {
            swap(v[nod],v[i]);
            cernere(i,k);
        }
    }
}

void heapify()
{
    for(int i=n/2;i>=1;--i)cernere(i,n);
}

void heapsort()
{
    heapify();
    for(int i=n;i>1;--i)
    {
        swap(v[i],v[1]);
        cernere(1,i-1);
    }
}

void citire()
{
    fscanf(fin,"%d",&n);
    for(int i=1;i<=n;++i)
        fscanf(fin,"%d",&v[i]);

    heapsort();

     for(int i=n;i>=1;--i)
        fprintf(fout,"%d ",v[i]);


}

//void citire()
//{
//    cin >> n;
//    for(int i=1;i<=n;++i)cin >> v[i];
//    heapsort();
//    for(int i=n;i>=1;--i)cout << v[i] << ' ';
//}

int main()
{
    citire();
    return 0;
}