#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],pivot2(0);
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];
    long sol=coef;
    Ssol[coef]=A[pivot];
    while (--coef) 
       for (i=pivot-1,pivot2=1;i>=pivot/2;--i,++pivot2) {
                                                         if (D[i]==coef && A[i]<A[pivot]){
                                                                                         Ssol[coef]=A[i];
                                                                                         pivot=i;
                                                                                         break;
                                                                                         }
                                                         if (D[pivot2]==coef && A[pivot2]<A[pivot]){
                                                                                                    Ssol[coef]=A[pivot2];
                                                                                                    pivot=pivot2;
                                                                                                    break;
                                                                                                    }
                                      }
    for (i=1;i<=sol;++i) cout<<Ssol[i]<<" ";
    
return 0;
}