#include <cstdio>
#include <vector>
using namespace std;
int n,a[100005],i,pos,best[100005],prev[100005],crt;
vector <int> sol;
int caut_bin(int val)
{
    int st=1;
    int dr=crt;
    int mij;
    while (st<dr)
    {
        mij=(st+dr)/2;
        if (a[best[mij]]<val) st=mij+1;
        else dr=mij;
    }
    mij=(st+dr)/2;
    if (a[best[mij]]<val) mij++;
    mij--;
    return mij;
}
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]);
    a[0]=99999999;
    for (i=1; i<=n; i++)
    {
        pos=caut_bin(a[i]);
        best[pos+1]=i;
        prev[i]=best[pos];
        if (pos+1>crt) crt=pos+1;
    }
    printf("%d\n",crt);
    for (i=best[crt]; i>0; i=prev[i]) sol.push_back(i);
    for (i=crt; i>=0; i--) printf("%d ",a[sol[i]]);
    return 0;
}