/*#include<fstream>
using namespace std;
ifstream F("scmax.in");
ofstream G("scmax.out");
#define N 100001
int a[N],b[N],p[N],i,j,k,m,n;
int main()
{
    F>>n;
    for(i=1;i<=n;++i) {
		F>>a[i];
        if(a[b[m]]<a[i])
            p[i]=b[m],b[++m]=i;
        for(j=0,k=m;j<k;)
        	if(a[b[(j+k)/2]]<a[i])
                j=(j+k)/2+1;
            else
                k=(j+k)/2;
        if(a[i]<a[b[j]]) {
			if(j)
                p[i]=b[j-1];
			b[j]=i;
        }
    }
    for(i=m,j=b[m];i--;j=p[j])
        b[i]=j;
    for(G<<m<<"\n",i=0;i<m;++i)
        G<<a[b[i]]<<" ";
    return 0;
}*/
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
const int N=2e5;
int v[N],p[N],q[N],i,j,n,Q,x;
void a(int I,int Z)
{
    while(p[Z]!=I)
        --Z;
    if(I>1)
        a(I-1,Z-1);
    g<<v[Z]<<" ";
}
int main()
{
    f>>n;
    for(i=1;i<=n;++i) {
        f>>v[i];
        x=v[i];
        j=1;
        while(x>q[j]&&j<=Q)
            ++j;
        q[j]=x;
        p[i]=j;
        Q=Q>j?Q:j;
    }
    g<<Q<<"\n";
    a(Q,n);
    return 0;
}