#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
int Num[1002];
int DP[1002];
int main()
{
    int Cases, Max;
    while( cin >> Cases )
    {
        memset(DP,0,sizeof(DP));
        for( int i=1; i<=Cases; ++i )
               scanf("%d",Num+i);
      Max=0;
      for(int i = 1;i <=Cases;i++)
      DP[i] = 1;
      for( int i=1; i<=Cases; ++i )
      {
        for( int j=1; j<i; ++j )
           if( Num[i] > Num[j] && DP[j]>=DP[i])
                   DP[i] = DP[j]+1;
        if( Max < DP[i] )
           Max = DP[i];
      }
      printf("%d\n",Max);
    }

    return 0;
}