#include <cstdio>
const int nmax=100001;
int a[nmax],p[nmax],q[nmax],n,i,j,k;

int search(int ls,int ld,int x){
    while (ls<=ld){
          int mij=(ls+ld)/2;
          if (q[mij]>=x && q[mij-1]<x) return mij;
          if (q[mij]<x) ls=mij+1;
                   else ld=mij-1;
          }
    return ++k;
    }

void write(int i,int k){
     if (k>0){
      if (p[i]==k) {write(i-1,k-1);
                    printf("%d ",a[i]);}
             else write(i-1,k);
      }
     }

int main(){
    FILE *fin, *fout;
	fin = fopen(argv[1], "r");
	fout = fopen(argv[2], "w");
    fscanf(fin,"%d",&n);
    for (i=1;i<=n;i++) fscanf(fin,"%d",&a[i]);
    for (i=1;i<=n;i++) {j=search(1,k,a[i]);
                        q[j]=a[i];
                        p[i]=j;}
    write(n,k, fout);
	fclose(fin);
	fclose(fout);
    return 0;
    }