#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define Nmax 100005
using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n,k=1;
int p[Nmax],d[Nmax],v[Nmax];
vector<int> sol;

int main()
{
    fin >> n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    d[k]=v[k];
    p[1]=1;
    for(int i=2;i<=n;i++)
    {
        if(v[i]>d[k])
            {
                d[++k]=v[i];
                p[i]=k;
            }
        else
        {
            int st=1, dr=k ,poz=k+1;
            while(st<=dr)
            {
                int m = (st+dr)/2;
                if(d[m]>=v[i])
                {
                    poz=m;
                    dr=m-1;
                }
                else
                    st=m+1;
            }
            d[poz]=v[i];
            p[i]=poz;
        }
    }
    int j=n;
    for(int i=k;i>=1;i--)
    {
        while(p[j]!=i)
            j--;
        sol.push_back(v[j]);
    }
    reverse(sol.begin(),sol.end());
    for(auto i : sol)
        fout<<i<<" ";
    return 0;
}