#include <iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("subsir.in");
ofstream g("subsir.out");
int x,L,pmax,st,dr,m,n1,n,i,j,v[100000],a[100000],d[100000],mx,k,aux,p;
int main()
{
    f>>n;
    for(i=1;i<=n;i++) f>>v[i];
    st=1;dr=n;j=1;
    for(j=1,L=0;j<=n;j++)
    {
        x=v[j];
        pmax = 0;
        st = 1;
        dr = L;
        while(st<=dr)
        {
            m=(st+dr)/2;
            if(a[m]<x)
            {
                pmax=m;
                st=m+1;
            }
            else
                dr=m-1;
        }

        if(pmax+1>L) L=pmax+1;
        a[pmax+1]=v[j];
        d[j]=pmax+1;
    }
    mx=0;
    for(i=1;i<=n;i++) if(d[i]>mx) {mx=d[i];p=i;}
    n1=mx;
    a[n1]=v[p];
    while(d[p]>1)
    {
        for(i=p-1;!(d[i]==d[p]-1&&v[i]<v[p]) ;i--);
        n1--;
        a[n1]=v[i];
        p = i;
    }


    for(i=1;i<=mx;i++) g<<a[i]<<' ';



}