#include<fstream>
using namespace std; 
ifstream f("scmax.in");
ofstream g("scmax.out");
int main() 
{int n,max=0,i,j,k,l[100001],v[100001],t;
f>>n;
for(i=1;i<=n;i++) 
	f>>v[i];
l[n]=1;
for(k=n-1;k>=1;k--) 
	{max=0;
		for(j=k+1;j<=n;j++) 
		if(v[j]>v[k] && l[j]>max) 
			max=l[j]; 
		l[k]=1+max;}
	max=l[1];	
	t=1;
	sort(l+1,l+n+1);
	g<<l[n]<<'\n'; 
			
			
		return 0; 
}