#include <iostream>
#include <fstream>

using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");

const int N = 500001;
int v[N], poz[N], h[N];
int n, nrad, nh, p, x;

void schimba(int p, int q)
{
    int aux = h[p];
    h[p] = h[q];
    h[q] = aux;
    //poz[h[p]] = p;
    //poz[h[q]] = q;
}

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

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

void sterge(int p)
{
    schimba(p, nh--);
    urca(p);
    coboara(p);
}

void adauga(int x)
{
    h[++nh] = x;
    //poz[x] = nh;
    urca(nh);
}

int main()
{
    in>>n;
    nrad = 0;
    nh = 0;
    for(int i = 0; i < n; i++)
    {
        in>>x;
        adauga(x);
    }
    for(int i = 0; i < n; i++)
    {
        out<<h[1]<<" ";
        sterge(1);
    }
    return 0;
}