#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 const int N=;

 int a[N];

 inline int find(int x,int l,int r)

 {

     if (l>=r) return l;

     int mid=(l+r)>>;

     return a[mid]>=x?find(x,l,mid):find(x,mid+,r);

 }

 int main()

 {

     int n,m=,x;

     scanf("%d",&n);

     while (n--)

     {

         scanf("%d",&x);

         a[x>a[m]?++m:find(x,,m)]=x;

     }

     printf("%d\n",m);

     return ;

 }