#include <stdio.h>
#include <stdlib.h>
#define N 500000

int h[N+1], v[N+1];

void schimba(int h[], int p1, int p2)
{
    int aux = h[p1];
    h[p1] = h[p2];
    h[p2] = aux;
}

void urca(int h[], int p)
{
    while (p > 1 && h[p] < h[p/2])
    {
        schimba(h, p, p / 2);
        p /= 2;
    }
}

void coboara(int h[], int nh, int p)
{
    int fs = 2 * p, fd = 2 * p + 1, pmin = p;
    if (fs <= nh && h[fs] < h[pmin])
    {
        pmin = fs;
    }
    if (fd <= nh && h[fd] < h[pmin])
    {
        pmin = fd;
    }
    if (pmin != p)
    {
        schimba(h, pmin, p);
        coboara(h, nh, pmin);
    }
}

void adauga(int h[], int *pnh, int val)
{
    (*pnh)++;
    h[*pnh] = val;
    urca(h, *pnh);
}

void sterge(int h[], int *pnh, int p)
{
    h[p] = h[*pnh];
    (*pnh)--;
    if (*pnh < p)
    {
        return;
    }
    urca(h, p);
    coboara(h, *pnh, p);
}

int main()
{
    FILE *in, *out;
    in = fopen("algsort.in", "r");
    out = fopen("algsort.out", "w");
    int n, nh = 0;
    fscanf(in, "%d", &n);
    for (int i = 1; i <= n; i++)
    {
        fscanf(in, "%d", &v[i]);
        adauga(h, &nh, v[i]);
    }
    n = 0;
    while (nh > 0)
    {
        v[++n] = h[1];
        sterge(h, &nh, 1);
    }
    for (int i = 1; i <= n; i++)
    {
        fprintf(out, "%d ", v[i]);
    }
    fclose(in);
    fclose(out);
    return 0;
}