#include <iostream>
#include <fstream>

using namespace std;
ifstream f ("algsort.in");
ofstream g ("algsort.out");
int n;
int MinArb[2000066];
int start, finish, val, poz, minim,poz1;

int mnm(int a, int b)
{
    if (a<b) return a;
    return b;
}

void update(int nod, int left, int right)
{
    if (left==right)
    {
        MinArb[nod]=val;
        return;
    }
    int mid=(left+right)/2;
    if (poz<=mid)
        update(2*nod,left,mid);
    else
        update(2*nod+1,mid+1,right);
    minim=mnm(MinArb[2*nod],MinArb[2*nod+1]);
}

void query(int nod, int left, int right)
{
    if (start<=left && right<=finish)
        if (minim>MinArb[nod])
         {
             minim=MinArb[nod];
             poz1=nod;
             return;
         }
     int mid=(left+right)/2;
     if (start<=mid)
        query(2*nod,left,mid);
     if(mid<right)
        query(2*nod+1,mid+1,right);

}
int main()
{
    int n,i,minim,x;
    f>>n;
    for (i=1;i<=n;i++)
    {
        f>>x;
        poz=i;
        val=x;
        update(1,1,n);
    }
    start=1;
    finish=n;
    for (i=1;i<=n;i++)
    {
        minim=1<<31;
        query(1,1,n);
        poz=poz1;
        val=1<<31;
        update(1,1,n);
        g<<minim<<' ';

    }
    f.close();
    g.close();
    return 0;
}