#include <iostream>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
#include <algorithm>
int main()
{
    int n;
    in>>n;
    int c=n,v[n],a[n],i;
    for(i=0;i<n;i++)
        in>>v[i];
    make_heap(v,v+n);
    while(n)
    {
        pop_heap(v,v+n);
        a[--i] = v[n-1];
        n--;
        make_heap(v,v+n);
    }
    for(i=0;i<c;i++)
        out<<a[i]<<" ";
    return 0;
}