#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
const int NMax = 500000;
int X[NMax + 5],Heap[NMax + 5];
int N,NHeap;
void Read()
{
    fin >> N;
    for(int i = 1; i <= N; ++i)
        fin >> X[i];
}

void UpHeap(int X)
{
    int Father = X / 2;
    if(Father && Heap[Father] > Heap[X])
    {
        swap(Heap[Father], Heap[X]);
        UpHeap(Father);
    }
}

void BuildHeap()
{
    for(int i = 1; i <= N; ++i)
    {
        Heap[++NHeap] = X[i];
        UpHeap(i);
    }
}

void DownHeap(int X)
{
    int Son1 = 2 * X, Son2 = 2 * X + 1, Son;
    if(Son1 > NHeap)
        return;
    if(Son1 == NHeap)
    {
        if(Heap[X] > Heap[Son1])
        {
            swap(Heap[X], Heap[Son1]);
            return;
        }
    }
    if(Heap[Son1] < Heap[Son2])
        Son = Son1;
    else
        Son = Son2;
    if(Heap[X] > Heap[Son])
        {
            swap(Heap[X], Heap[Son]);
            DownHeap(Son);
        }
}

void HeapSort()
{
    for(int i = 1; i <= N; ++i)
    {
        X[i] = Heap[1];
        Heap[1] = Heap[NHeap];
        NHeap--;
        DownHeap(1);

    }
}
void Print()
{
    for(int i = 1; i <= N; ++i)
        fout << X[i] << " ";
    fout << "\n";
}
int main()
{
    Read();
    BuildHeap();
    HeapSort();
    Print();
    return 0;
}