//#include <stdio.h>   
#include<fstream>
using namespace std;
int n, v[100003], best[100003], p[100003], maxim, k, L[100003], nr;
ifstream f("scmax.in");
ofstream g("scmax.out");
void afis(int i)
{
   if (p[i] > 0) 
	   afis(p[i]);
  // printf("%d ",v[i]);
   g<<v[i]<<" ";
}

int caut(int x)
{
   int dr, st, m;
   st = 0; 
   dr = nr; 
   //m = (p+u)/2;
   while (st <= dr)
   {
	   m = (st + dr)/2;
      if (v[L[m]] < x &&  v[L[m+1]] >= x) 
		  return m;
      else 
		  if (v[L[m]] < x) 
		  st = m + 1; 
      else 
		  dr = m - 1; 
   }
   return nr;
}

int main()
{
   //freopen("scmax.in","r",stdin);
   //freopen("scmax.out","w",stdout);
   int i, j, poz;
   nr = 1;

  // scanf("%d",&n);
   f>>n;
   for (i = 1; i <= n; i++) 
	   //scanf("%d", v + i);
	   f>>v[i];
   best[1] = L[1] = 1; 
   L[0] =  0;

   for (i = 2; i <= n; i++)
   {
      poz = caut(v[i]);
	 // g<<caut(v[i])<<" "<<nr<<"\n";
      p[i] = L[poz];
      best[i] = poz + 1;
      L[poz + 1] = i;
      if (nr < poz + 1)   
		  nr = poz + 1;
   }
   maxim = 0; poz = 0;
   for (i = 1; i <= n; i++)
       if (maxim < best[i])
       {
          maxim = best[i]; 
		  poz = i;
       }
   //printf("%d\n",maxim);
	   g<<maxim<<"\n";
	   // g<<"best="<<" ";
	   //for(i=1;i<=n;i++)
		//  g<<best[i]<<" ";
	   //g<<"\n";
	   //g<<"P="<<" ";
	   //for(i=1;i<=n;i++)
		//   g<<p[i]<<" ";
	   //g<<"\n";
	   //g<<"L="<<" ";
	    //for(i=1;i<=n;i++)
			//g<<L[i]<<" ";
	    //  for(i=1;i<=n;i++)
			//  g<<L[i]<<" ";
		   
   afis(poz);
   return 0;   
}