#include<cstdio>
using namespace std;
int a[100010],i,n,k,q[100010],p[1000010];
inline int binsearch(int st,int dr,int n)
{
   int  poz=(st+dr)/2;
    if (st>dr) return 0;
    if (st==dr)
        {
            if (q[poz]>=n) return poz;
                    else return 0;
        }
    if (q[poz]<=n) return binsearch(poz+1,dr,n);
    if (q[poz]>n) return binsearch(st,poz-1,n);
}
inline void back(int k)
{
    int cop=k,i=n,v[100010];
    while (i>0 && cop>0)
    {
        if (p[i]==cop) {
                        v[cop]=a[i];
                        cop--;
                        }
        i--;
    }
    for (i=1;i<=k;i++)
        printf("%d ",v[i]);
}
inline void cmlsc()
{
    int i,poz,k;
    q[1]=a[1];
    p[1]=1;
    k=1;
    for (i=2;i<=n;i++)
    {
        poz=binsearch(1,k,a[i]);
       if (poz==0) { q[++k]=a[i];
                     p[i]=k;
                    }
            else { q[poz]=a[i];
                   p[i]=poz;
                 }
    }
    printf("%d\n",k);
    back(k);
}
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]);
    cmlsc();
    return 0;
}