#include<bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int best[100003],a[100003], maxim,sol=0,poz[100003],p;
int n;
void read()
  {
   f>>n;
   for(int i=1;i<=n;++i)
    f>>a[i];
  }
void dinamic()
  {
  int i,j;
  best[n]=1;
  poz[n]=-1;
  maxim=1;
  p=n;
  for(i=n-1;i>=1;--i)
   {
   best[i]=1;
   poz[i]=-1;
   for(j=i+1;j<=n;++j)
       if(a[i]<a[j] && best[i]<best[j]+1)
         {
         best[i]=best[j]+1;
         poz[i]=j;
         if(best[i]>maxim) maxim=best[i],p=i;
         }
   }
  }
void constr()
  {g<<"\n";
  int i;
  i=p;
  while(i!=-1)
   {
   g<<a[i]<<" ";
   i=poz[i];
   }
  }
int main()
  {
  read();
  dinamic();
  g<<maxim;
  constr();
  return 0;
  }