# include <cstdio>
# define MAXN 100010
using namespace std;
int a[MAXN],p[MAXN],v[MAXN],sub[MAXN];
int n,i,Max,poz;
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) return st;
    return p;
}
void stivpoz()
{
    v[1]=a[1];
    v[0]=1;
    p[1]=1;
    for(i=2; i<=n; ++i)
    {
        if(a[i]>v[v[0]])
        {
            v[0]++;
            v[v[0]]=a[i];
            p[i]=v[0];
        }
        else{ p[i]=cautare(a[i],v); v[p[i]]=a[i];}
        if(p[i]>Max) {Max=p[i]; poz=i;}
    }
}
void sol()
{
    int curent=p[poz];
    int k=0;
    printf("%d\n",Max); sub[++k]=a[poz];
    for(i=poz-1; i>=1; --i)
    if(p[i]==curent-1 && p[i]<curent)
    {
        sub[++k]=a[i];
        curent=p[i];
    }
    for(i=k; i>=1; --i)
    printf("%d ", sub[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]);
    stivpoz();
    sol();
    fclose(stdin);
    fclose(stdout);
    return 0;
}