#include <bits/stdc++.h>
using namespace std;
int a[1001],dp[1001],n,ans;
int main() {
	scanf("%d",&n);
	for(int i = 1;i<=n;i++)scanf("%d",&a[i]);
	for(int i = 1;i<=n;i++){
		dp[i] = 1;
		for(int j = 1;j<i;j++)
			if(a[j]<a[i])dp[i] = max(dp[j]+1,dp[i]);
		ans = max(ans,dp[i]);
	}
	printf("%d",ans);
	return 0;
}

#include <bits/stdc++.h> using namespace std; int a[1001],dp[1001],n,ans; int main() { scanf("%d",&n); for(int i = 1;i<=n;i++)scanf("%d",&a[i]); for(int i = 1;i<=n;i++){ dp[i] = 1; for(int j = 1;j<i;j++) if(a[j]<a[i])dp[i] = max(dp[j]+1,dp[i]); ans = max(ans,dp[i]); } printf("%d",ans); return 0; }