#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int v[100005],q[100005],sol[100005],p[100005],lmax,cnt,n;
int cautare(int a)
{
    int st=1,dr=cnt,mijl;
    while(st<=dr)
    {
        mijl=(st+dr)/2;
        if(a>=q[mijl])
            st=mijl+1;
        else
            dr=mijl-1;

    }
    if(q[st-1]==a)
        return st-1;
    return st;
}
int main()
{
    int i,c,cntm;
    in>>n;
    for(i=1; i<=n; ++i)
    {
        in>>v[i];
        c=cautare(v[i]);
        if(c>cnt)
        {
            q[++cnt]=v[i];
            p[i]=cnt;
        }
        else
        {
            if(v[i]!=q[c])
            {
                q[c]=v[i];
                p[i]=cnt;
            }
        }
    }
    cntm=cnt;
    int c1=1;
    for(i=n; i>=0; --i)
    {
        if(p[i]==cnt)

        {
            sol[c1]=v[i];
            c1++;
            cnt--;
        }


    }
    out<<cntm<<"\n";
    for(i=cntm; i>=1; --i)
        out<<sol[i]<<" ";
    return 0;
}