#include<bits/stdc++.h>
using namespace std;
int a[10005], dp[10005];
int n;
int main () {
cin >> n;
for (int i = 1; i <= n; i ++) cin >> a[i];
memset (dp, 1, sizeof dp);
dp[0] = 0;
for(int i = 1; i <= n; i ++) {
for (int j = 0; j <= i; j ++) {
if(a[i] > a[j]) dp[i] = max (dp[i], dp[j] + 1);
}
}
cout << dp[n] << endl;
return 0;
}