#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,maxf,u,m,t,k,p;
int a[100001],b[100001],c[100001],nr,sol[100001];
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        f>>a[i];
    b[1]=1;
    c[1]=a[1];
    m=1;
    for(i=2;i<=n;i++)
    {
        if(a[i]<=c[1])
        {
            b[i]=1;
            c[1]=a[i];
        }
        else
            if(a[i]>c[m])
        {
            b[i]=m+1;
            c[m+1]=a[i];
            m++;
        }
        else
        {
            p=1;
            u=m;
            while(p<=u)
            {
                k=(p+u)/2;
                if(a[i]>=c[k]&&a[i]<=c[k+1])
                {
                    t=k;
                    break;
                }
                else
                    if(a[i]<c[k])
                    u=k-1;
                else
                    p=k+1;
            }
            b[i]=t+1;
            c[t+1]=a[i];
        }
    }
    /*
    for(i=1;i<=n;i++)
        g<<a[i]<<" ";
    g<<endl;
    for(i=1;i<=n;i++)
        g<<b[i]<<" ";
    return 0;
    */

    /*for(i=1;i<=m;i++)
    {
        g<<c[i]<<" ";
    }
    */
    maxf=0;
        for(i=1;i<=n;i++)
        if(b[i]>maxf)
        {
            maxf=b[i];
            p=i;
        }
        g<<maxf<<"\n";
        nr=0;
    while(maxf)
    {
        nr++;
        sol[nr]=a[p];
        for(j=1;j<=p;j++)
            if(a[p]>a[j]&&b[j]==maxf-1)
        {
            p=j;
            break;
        }
        maxf--;
    }
    for(i=nr;i>=1;i--)
        g<<sol[i]<<" ";
    return 0;
}