#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int Heap[1001000];
int minim(int Heap[])
{
    return Heap[1];
}
int tata(int nr)
{
    return nr/2;
}
int fiu_stang(int nr)
{
    return nr*2;
}
int fiu_drept(int nr)
{
    return nr*2+1;
}
void swap(int &a,int &b)
{
    int aux=a;
    a=b;
    b=aux;
}
void adauga(int x,int k)
{
    Heap[k]=x;
    while(k/2!=0 && Heap[tata(k)]>Heap[k])
    {
        swap(Heap[tata(k)],Heap[k]);
        k=tata(k);
    }
    k++;
}
void extragere(int k,int N)
{
    fout<<Heap[1]<<" ";
    int i=1;
    while(k<N)
    {
        if(Heap[fiu_stang(i)]!=0 && Heap[fiu_stang(i)]<=Heap[fiu_drept(i)])
        {
            Heap[i]=Heap[fiu_stang(i)];
            i=fiu_stang(i);
        }
        else if(Heap[fiu_drept(i)]!=0 && Heap[fiu_stang(i)]>=Heap[fiu_drept(i)])
        {
            Heap[i]=Heap[fiu_drept(i)];
            i=fiu_drept(i);
        }
        else if(Heap[fiu_stang(i)]!=0)
        {
            Heap[i]=Heap[fiu_stang(i)];
            i=fiu_stang(i);
        }
        else if(Heap[fiu_drept(i)]!=0)
        {
            Heap[i]=Heap[fiu_drept(i)];
            i=fiu_drept(i);
        }
        else break;
    }
    Heap[i]=0;
}
int main()
{
    int i,x,N;
    fin>>N;
    for(i=1;i<=N;i++)
    {
        fin>>x;
        adauga(x,i);
    }
    for(i=1;i<=N;i++)
    {
        extragere(i,N);
    }
    fin.close();
    fout.close();
    return 0;
}