#include<bits/stdc++.h>
using namespace std;

const int NMAX = 1e5 + 10;

int lis[NMAX], v[NMAX];
int pre[NMAX];
int main() {
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);

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

    for (int i = 1; i <= n; i++) {
        int best_j = i;
        for (int j = 1; j < i; j++) {
            if (v[j] < v[i] && lis[j] > lis[best_j])
                best_j = j;
        }
        lis[i] = lis[best_j] + 1;
    }
    int result = 0;
    for (int i = 1; i <= n; i++) {
        result = max(result, lis[i]);
    }
    printf("%d", result);
    return 0;
}