#include <fstream>
#include <algorithm> 
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");

long n,i,j,A[100013],D[100013],coef,sol,Lbest,pivot,Ssol[100013];

int cauta(int val)
{
 int i,step;
 for (step=1;step<pivot;step<<=1);
 for (i=0;step;step>>=1)
     if (i+step<pivot && D[i+step]<=val && A[i+step]<A[pivot]) i+=step;
 return i;
}


int main()
{
    cin>>n;
    for (i=1;i<=n;++i) cin>>A[i];
    D[1]=1;
    for (i=2;i<=n;++i){
                       Lbest=0;
                       for (j=i-1; j>0;--j) 
                                  if (A[j]<A[i]) Lbest=max(Lbest,D[j]);               
                       D[i]=1+Lbest;           
                      }
    for (i=1;i<=n;++i) 
        if (D[i]>Lbest) { 
                         pivot=i;
                         Lbest=D[i];
                         }
    cout<<D[pivot]<<"\n";
    coef=D[pivot];
    Ssol[coef]=A[pivot];
    sol=coef;
    while (--coef) {
                    pivot=cauta(coef);
                    Ssol[coef]=A[pivot];
                   }
    for (i=1;i<=sol;++i) cout<<Ssol[i]<<" ";
    
return 0;
}