#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,arr[10000],L[10000],length=0;
cin>>n;
for(int i=0;i<n;cin>>arr[i++]);
L[0]=arr[0];
for(int i=1;i<n;++i)
if(arr[i]>L[length])
L[++length]=arr[i];
else
*lower_bound(L,L+length,arr[i])=arr[i];
cout<<length<<endl;
return 0;
}