#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");

#define NMAX 500010

int n, h[NMAX], l;

void sift(int k)
{
    int son;
    do
    {
        son = 0;
        if (k * 2 <= l)
        {
            son = k * 2;
            if (k * 2 + 1 <= l && h[k * 2 + 1] < h[k * 2])
            {
                son = k * 2 + 1;
            }
            if (h[son] >= h[k])
            {
                son = 0;
            }
        }
        if (son)
        {
            swap(h[k],h[son]);
            k = son;
        }
    } while (son);
}

void percolate(int k)
{
    int key = h[k];
    while (k > 1 && key < h[k / 2])
    {
        h[k] = h[k / 2];
        k /= 2;
    }
    h[k] = key;
}

int main()
{
    int i, j;
    f>>n;
    f>>h[1];
    l = 1;
    for (i = 2;i <= n;i++)
    {
        f>>h[i];
        l++;
        percolate(i);
    }
    for (i = 1;i <= n;i++)
    {
        g<<h[1]<<" ";
        swap(h[1],h[l]);
        l--;
        sift(1);
    }
}