# include <cstdio>
using namespace std;
int n,i,a[100001],poz[100001],v[100001],Max=0,p,sub[100001],k=0;
int cautare(int x, int X[])
{
    int p=0,st,dr,mij;
    st=1; dr=X[0];
    while(st<=dr && p==0)
    {
        mij=(st+dr)/2;
        if(X[mij]==x) p=mij;
        else if(X[mij]>x) dr=mij-1;
        else st=mij+1;
    }
    if(p==0) p=st;
    return p;
}

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]);
    v[1]=a[1]; v[0]=1; poz[1]=1;
    for(i=2; i<=n; ++i)
    {
        if(a[i]>v[v[0]])
        {
            v[v[0]+1]=a[i];
            v[0]++;
            poz[i]=v[0];
        }
        else {poz[i]=cautare(a[i],v); v[poz[i]]=a[i];}
        if(poz[i]>Max) {Max=poz[i]; p=i;}
    }
    int curent=poz[p];
    printf("%d\n",Max); sub[++k]=a[p];
    for(i=p-1; i>=1; --i)
    if(poz[i]==curent-1 && poz[i]<curent)
    {
        sub[++k]=a[i];
        curent=poz[i];
    }
    for(i=k; i>=1; --i)
    printf("%d ", sub[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}