#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 1010;

int a[N], f[N];

int main() {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) 
        scanf("%d", &a[i]);

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

    int ans = 1;
    for (int i = 1; i <= n; ++i)
        ans = max(ans, f[i]);
    cout << ans;
    return 0;
}