#include <bits/stdc++.h>
#define MAX 500000

using namespace std;

void update(int *T, int node, int left, int right, int value, int pos) {
    if(left == right) {
        T[node] = value;
        return;
    } else {
        int mid = (left + right) / 2;
        if(pos <= mid) {
            update(T, 2 * node, left, mid, value, pos);
        } else {
            update(T, 2 * node + 1, mid + 1, right, value, pos);
        }
    }
    T[node] = max(T[2 * node], T[2 * node + 1]);
}

void query(int *T, int nod, int left, int right, int a, int b, int &maxim)  {
    if(left >= a && right <= b) {
        if(T[nod] > maxim) {
            maxim = T[nod];
        }
        return;
    }
    int mid = (left + right) / 2;
    if(a <= mid) {
        query(T, 2 * nod, left, mid, a, b, maxim);
    }
    if(b > mid) {
        query(T, 2 * nod + 1, mid + 1, right, a, b, maxim);
    }
}
int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    int n;
    int T[MAX];
    scanf("%d", &n);
    int v[n + 1], ord[n + 1], best[n + 1] = {0};
    for(int i = 1; i <= n; i++) {
        scanf("%d", &v[i]);
        ord[i] = v[i];
    }
    sort(ord + 1, ord + n + 1);
    int cnt = 1;
    for(int i = 1; i <= n; i++) {
        v[i] = lower_bound(ord + 1, ord + n + 1, v[i]) - ord;
    }
    for(int i = 1; i <= n; i++) {
        query(T, 1, 1, n, 1, v[i], best[i]);
        best[i]++;
        update(T, 1, 1, n, best[i], v[i]);
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        ans = max(ans, best[i]);
    }
    printf("%d\n", ans);
    return 0;
}