#include <bits/stdc++.h>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

const int MaxN = 100005;
int n, a[MaxN], ans = 1, aib[MaxN], dp[MaxN];
pair<int, int>b[MaxN];

void Update(int p, int val){
    for(p; p <= n; p += (p & (-p)))
        aib[p] = max(aib[p], val);
}

int Query(int p){
    int s = 0;
    for(p; p > 0; p -= (p & (-p)))
        s = max(s, aib[p]);
    return s;
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> a[i], b[i] = { a[i], i };
    sort(b + 1, b + n + 1);
    int val = 1;
    a[b[1].second] = 1;
    for(int i = 2; i <= n; i++){
        if(b[i].first != b[i - 1].first)
            val++;
        a[b[i].second] = val;
    }
    for(int i = 1; i <= n; i++){
        dp[i] = max(dp[i], Query(a[i] - 1) + 1);
        Update(a[i], dp[i]);
        ans = max(ans, dp[i]);
    }
    fout << ans << "\n";
    return 0;
}