#include <iostream>

#define NMAX 500000

static int _max_down(int *v, int n, int i)
{
    int j = i;

    for (int k = (i << 1) + 1; k <= (i << 1) + 2; ++k)
        if (k < n && v[k] > v[j])
            j = k;

    return j;
}

void heap_sort(int *v, int n)
{
    int a;

    for (int k = (n >> 1) - 1; k >= 0; --k) {
        for (int i = k, j = _max_down(v, n, i); j != i; i = j, j = _max_down(v, n, i)) {
            a = v[i];
            v[i] = v[j];
            v[j] = a;
        }
    }

    for (--n; n > 0; --n) {
        a = v[n];
        v[n] = v[0];
        v[0] = a;

        for (int i = 0, j = _max_down(v, n, i); j != i; i = j, j = _max_down(v, n, i)) {
            a = v[i];
            v[i] = v[j];
            v[j] = a;
        }
    }
}

int main()
{
    int n;
    int v[NMAX];

    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    std::cin >> n;

    for (int i = 0; i < n; ++i)
        std::cin >> v[i];

    heap_sort(v, n);

    for (int i = 0; i < n; ++i)
        std::cout << v[i] << ' ';

    std::cout << '\n';

    return 0;
}