#include <cstdio>
#include <vector>
using namespace std;
int n,a[100005],i,pos,best[100005],prv[100005],crt;
vector <int> sol;
int caut_bin(int val)
{
    int i,step;
    for(step=1; step<crt; step<<=1);
    for(i=0; step; step>>=1)
        if(i+step<=crt && a[best[i+step]]<val)
            i+=step;
    return i;
}
int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    scanf("%d",&n);
    for (i=1; i<=n; i++) scanf("%d",&a[i]);
    for (i=1; i<=n; i++)
    {
        pos=caut_bin(a[i]);
        best[pos+1]=i;
        prv[i]=best[pos];
        if (pos+1>crt) crt=pos+1;
    }
    printf("%d\n",crt);
    for (i=best[crt]; i>0; i=prv[i]) sol.push_back(i);
    for (i=crt-1; i>=0; i--) printf("%d ",a[sol[i]]);
    return 0;
}