#include <bits/stdc++.h>

using namespace std;

void max_heapify(int H[], int N, int i)
{
    int l, r, largest;
    bool changed;

    do
    {
        changed = false;

        l = 2 * i;
        r = 2 * i + 1;

        if (l <= N && H[l] > H[i])
            largest = l;
        else
            largest = i;

        if (r <= N && H[r] > H[largest])
            largest = r;

        if (i != largest)
        {
            swap(H[i], H[largest]);
            i = largest;
            changed = true;
        }

    } while (changed == true);
}

void build_max_heap(int H[], int N)
{
    for (int i = N / 2; i >= 1; i--)
        max_heapify(H, N, i);
}

void heapsort(int H[], int N)
{
    build_max_heap(H, N);

    for (int i = N; i >= 2; i--)
    {
        swap(H[i], H[1]);
        N--;
        max_heapify(H, N, 1);
    }
}

const int MAX_N = 500000 + 1;

int A[MAX_N];
int N;

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");

    in >> N;

    for (int i = 1; i <= N; ++i)
        in >> A[i];

    heapsort(A, N);

    for (int i = 1; i <= N; ++i)
        out << A[i] << " ";

    return 0;
}