#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
#define LSB(a) ((-a) & a)
using namespace std;

#ifdef LOCAL
#define read() ifstream fin("date.in.txt");
#else
#define read() ifstream fin("scmax.in"); ofstream fout("scmax.out");
#endif // LOCAL
read();

const int N = 100005;
int n, AIB[N];
int v[N];
map<int,int> idx;
set<int> vals;
bool have[N];

bool cmp(int a, int b) {
    return v[a] < v[b];
}

int countUnder(int pos) {
    int mx = 0;
    while(pos > 0) {
        mx = max(mx, AIB[pos]);
        pos -= LSB(pos);
    }
    return mx;
}

void update(int pos, int secv) {
    while(pos <= n) {
        if(AIB[pos] <= secv){
            have[pos] = false;
            AIB[pos] = secv;
        }
        pos += LSB(pos);
    }
}


int main() {
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        vals.insert(v[i]);
    }

    int p = 1;
    for (int x : vals)
          idx[x] = p++;

    for (int i = 1; i <= n; ++i) {
        int secv;

        if(have[idx[v[i]]]) {
            secv = countUnder(idx[v[i]]);
        }
        else
            secv = countUnder(idx[v[i]]) + 1;


        //cout << v[i] << " " << idx[v[i]] << " " << secv <<  '\n';
        update(idx[v[i]], secv);
        have[idx[v[i]]] = true;
        /*for (int i = 1; i <= n; ++i) {
            cout << AIB[i] << " ";
        }
        cout << '\n';
        for (int i = 1; i <= n; ++i)
            cout << have[i] << " ";
        cout << '\n';
    */}

    int mx = 0;
    for (int i = 1; i <= n; ++i)
        mx = max(mx, AIB[i]);

    #ifdef LOCAL
    cout << mx << '\n';
    #else
    fout << mx << '\n';
    #endif // LOCAL

    return 0;
}