#include <fstream>
#include <algorithm>
using namespace std;

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

int n, i;
int a[500001];

int main()
{
    f >> n;
    for (i = 1; i <= n; i++)
        f >> a[i];

    make_heap(a+1, a+n+1);
    sort_heap(a+1, a+n+1);

    for (i = 1; i <= n; i++)
        g << a[i] << " ";
    return 0;
}