#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,x;
vector <int> v;
int compare(int a,int b)
{
    return (a>b);
}
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>x;
        v.push_back(x);
    }
    make_heap(v.begin(),v.end(),compare);
    for(i=1;i<=n;i++)
    {
    pop_heap(v.begin(),v.end(),compare);
    x=v.back();
    v.pop_back();
    g<<x<<" ";
    }
    return 0;
}