//POj 2533 Longest Ordered Subsequence(动态规划：最长不减子序列)

//POj 2533 Longest Ordered Subsequence(动态规划：最长不减子序列)
#include<iostream>
#include<cstdio>
using namespace std;
const int N=5050;
const int inf=1000000;
int search_erfen(int b
,int num,int right)
{
int left=0;
int mid;
while(left!=right)
{
mid=(left+right)/2;
if(num==b[mid])
{
return mid;
}
else if(num<b[mid])
{
right=mid;
}
else
{
left=mid+1;
}
}
return left;

}
int main()
{
int n;
while(~scanf("%d",&n))
{
int a
;
int b
;
int i;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
int len=1;
b[0]=-1;
int flag;
//==========主要算法部分========
for(i=1;i<=n;i++)
{
b[len]=inf;
flag=search_erfen(b,a[i],len);//二分搜索
if(flag==len)
{
len++;
}
b[flag]=a[i];
}
//================================
printf("%d\n",len-1);
}
return 0;
}