#include <cstdio>

#include <algorithm>
#include <iostream>

using namespace std;

const int MAXN = 500001;
int A[MAXN];

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

    int n;
    cin >> n;
    for (int i = 0; i < n; ++i)
        cin >> A[i];
    make_heap(A, A + n);
    sort_heap(A, A + n);
    for (int i = 0; i < n - 1; ++i)
        cout << A[i] << " ";
    cout << A[n - 1] << "\n";

    return 0;
}