#include <fstream>
#include <algorithm>
#include <map>
#define N 300010
using namespace std;
ifstream cin("lunch.in");
ofstream cout("lunch.out");
int f[N]={0};
int a[N]={0};
int s[N]={0};
int n;
void add(int x,int val)
{
	int i;
	for(i=x;i>0;i-=(i&(-i)))s[i]=max(s[i],val);
}
int query(int x)
{
	int i;
	int ans=0;
	for(i=x;i<=N-10;i+=(i&(-i)))ans=max(ans,s[i]);
	return ans;
}
void read()
{
	int i;
	cin>>n;
	for(i=1;i<=n;i++)cin>>a[i],a[i]++;
}
map<int,int > F;
int C[N]={0};
int D[N]={0},m=0;
bool com(int a,int b){return a>b;}
void lisanhua()
{
	int i;
	for(i=1;i<=n;i++)C[i]=a[i];
	sort(C+1,C+n+1);
	for(i=1;i<n;i++)if(C[i]==C[i+1])C[i]=-1;
	for(i=1;i<=n;i++)if(C[i]!=-1)D[++m]=C[i];
	for(i=1;i<=m;i++)F[D[i]]=i;
	for(i=1;i<=n;i++)a[i]=F[a[i]]+1;
}
void work()
{ 
	//lisanhua();
	int ans=0;
	int i;
	/*for(i=1;i<=n;i++)cout<<a[i]<<' ';
	cout<<endl;*/
	for(int i=1;i<=n;i++)
	{
		if(a[i]==1)f[i]=query(a[i]);
        else
		{
			f[i]=query(a[i])+1;
		    add(a[i]-1,f[i]);
		}
	}
	/*for(int i=1;i<=n;i++)cout<<f[i]<<' ';
	cout<<endl;*/
	for(int i=1;i<=n;i++)ans=max(ans,f[i]);
	cout<<ans<<endl;
	
}
int main()
{
	read();
	work();
	return 0;
}