#include<cstdio>
#include<cstdlib>
int n,arb[400000],value,index,infinit=2147483648;
int minim(int x,int y)
{
       if(x<y)
       return x;
       return y;
}
void UpdateArb(int nod,int st,int dr)
{
     if(st==dr)
     {
               arb[nod]=value;
               return;
     }
     int mij=(st+dr)/2;
     if(index<=mij)
                   UpdateArb(nod*2,st,mij);
     else
                   UpdateArb(nod*2+1,mij+1,dr);
     arb[nod]=minim(arb[nod*2],arb[nod*2+1]);     
}

void DeleteVal(int nod,int st,int dr,int val)
{
    if(st==dr)
    {
             arb[nod]=infinit;
             return;
    }
    int mij=(st+dr)/2;
    if(arb[nod*2]==val)
    DeleteVal(nod*2,st,mij,val);
    else
    DeleteVal(nod*2+1,mij+1,dr,val);
    arb[nod]=minim(arb[nod*2],arb[nod*2+1]);
}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    int i,n,x;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
                     scanf("%d",&x);
                     index=i;value=x;
                     UpdateArb(1,1,n);
    }

    for(i=1;i<=n;i++)
    {
                     printf("%d ",arb[1]);
                     DeleteVal(1,1,n,arb[1]);
    }
    return 0;
}