#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;
///best[i]=capatul minim unui subsir crescator de lg i
int main()
{
    int i,j,poz,lgmax;
    fin>>n;
    for(i=1;i<=n;i++) fin>>a[i];
    best[p=1]=a[1];
    for(i=2;i<=n;i++)
        if(a[i]>best[p]) best[++p]=a[i];
        else best[lower_bound(best+1,best+p+1,a[i])-best]=a[i];
    fout<<p<<"\n";
    for(i=1;i<=p;i++) fout<<best[1]<<" ";
    return 0;
}