int n; cin >> n;
vector<int> a(n);
for (int &x: a) cin >> x;

vector<int> f(n);
int result = 1;
for (int i=0; i<n; i++) {
    f[i] = 0;
    for (int j=i-1; j>=0; j--) if (a[i] > a[j]) {
        f[i] = max(f[i], f[j]);
    }
    f[i] += 1;
    result = max(result, f[i]);
}

cout << result;
return 0;