#include <fstream>

using namespace std;
long long int v[100000],q[100000],p[100000];
long long int cautare(long long int p,long long int u,long long int x,long long int q[],long long int OK)
{
    while (p<u)
    {
        long long int m=(p+u)/2;
        if (x>q[m])
        {
            p=m+1;
            OK=-1;
        }
        if (x<q[m])
        {
            u=m-1;
            OK=1;
        }
        if (x==q[m])
        {
            return m;
        }
    }
    if (OK==-1)
        return p;
    else
        return u+1;
}
int main()
{
    long long int n,i,j;
    ifstream fin("scmax.in");
    ofstream fout("scmax.out");
    fin>>n;
    for (i=1; i<=n; i++)
    {
        fin>>v[i];
    }
    q[1]=v[1];
    p[1]=1;
    long long int u=1;
    for (i=2; i<=n; i++)
    {
        if (u==1)
        {
            if (v[i]>q[u])
            {
                u++;
                q[u]=v[i];
                p[i]=u;
            }
            else
            {
                q[u]=v[i];
                p[i]=1;
            }
        }
        else
        {
            if (v[i]<=q[u] && v[i]>=q[1])
            {
                long long int x=cautare(1,u,v[i],q,2);
                q[x]=v[i];
                p[i]=x;
            }
            else
            {
                if (v[i]>q[u])
                {
                    u++;
                    q[u]=v[i];
                    p[i]=u;
                }
                if (v[i]<q[1])
                {
                    q[1]=v[i];
                    p[i]=1;
                }
            }

        }
    }
    fout<<u<<"\n";
    int o=u;
    for (i=n; i>=1; i--)
    {
        if (p[i]==u)
        {
            q[u]=i;
            u--;
        }
    }
    for (i=1; i<=o; i++)
        fout<<v[q[i]]<<" ";
    return 0;
}