#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<cstring>
#include<deque>
#define maxn 1010
#define itn int
#define xlm mylove
using namespace std;
typedef long long LL;typedef unsigned long long ULL;
int n,a[maxn],f[maxn];
inline void in(){
//	freopen("a.in","r",stdin);
	freopen("lis1.in","r",stdin);
	freopen("lis1.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
    	scanf("%d",&a[i]);
    	f[i]=1;
    }
}
inline void dp(){
	for (int i=1;i<=n;i++){
		for (int j=1;j<=i;j++){
			if (a[i]>a[j]){
				f[i]=max(f[i],f[j]+1);
			}
		}
	}
}
inline void p(){
	int Max=-1;
	for (int i=1;i<=n;i++){
		Max=max(f[i],Max);
	}
	printf("%d",Max);
}
int Main(){
	in();
	dp();
	p();
	return 0;
}
int main(){;}
int xlm=Main();