#include <iostream>
#include <fstream>
#define MAX 2147483640

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

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;
        poz[nod]=i;
        return;
    }
    int mid=(left+right)/2;
    if (pos<=mid)
        update(2*nod,left,mid);
    else
        update(2*nod+1,mid+1,right);
    if(MinArb[2*nod]<MinArb[2*nod+1])
    {
        MinArb[nod]=MinArb[2*nod];
        poz[nod]=poz[2*nod];
    }
    else
    {
        MinArb[nod]=MinArb[2*nod+1];
        poz[nod]=poz[2*nod+1];
    }
}

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

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

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