#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,a[N],best[N],p,lg[N];
///best[i]=capatul minim unui subsir crescator de lg i
void SCLM(int poz,int l)
{
    if(l)
    {
        for(int i=poz;i;i--)
            if(lg[i]==l) {SCLM(i,l-1);fout<<a[i]<<" ";break;}
    }
}
int main()
{
    int i,j,poz,lgmax;
    fin>>n;
    for(i=1;i<=n;i++) fin>>a[i];
    best[p=1]=a[1];lg[1]=1;
    for(i=2;i<=n;i++)
        if(a[i]>best[p]) best[++p]=a[i],lg[i]=p;
        else best[lower_bound(best+1,best+p+1,a[i])-best]=a[i],
             lg[i]=lower_bound(best+1,best+p+1,a[i])-best;
    fout<<p<<"\n";
    ///for(i=1;i<=n;i++)///cout<<lg[i]<<" ";
       /// if(lg[i]==p) {poz=i;break;}
    ///for(i=1;i<=p;i++) fout<<best[i]<<" ";
    SCLM(n,p);
    return 0;
}
/**
4
5
8
9
10

4
5
8
8
10
*/