#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
 
ifstream fin("algsort.in");
ofstream fout("algsort.out");
 
int i, N;
int H[500001];
 
void UP_heap(int u) {
    while (u != 1 && H[u] < H[u / 2]) swap(H[u], H[u / 2]), u /= 2;
}
 
void DOWN_heap(int u) {
    while (1) {
        int m = u;
        if (2 * u <= N && H[2 * u] < H[m]) m = 2 * u;
        if (2 * u + 1 <= N && H[2 * u + 1] < H[m]) m = 2 * u + 1;
        if (m == u)
            break;
        swap(H[u], H[m]);
        u = m; 
    }
}
 
int main() {
    fin >> N;
    for (i = 1; i <= N; ++i) {
        fin >> H[i];
    }
    for (i = N / 2; i >= 1; --i)
        DOWN_heap(i);

    while (N) {
        fout << H[1] << ' ';
        swap(H[1], H[N--]);
        DOWN_heap(1);
    }
    fout << '\n';
    return 0;
}