/**
 *    author:  orzvanh14 ( Độc cô cầu đặc )
 *    created: 20.05.2026 21:04:02
 *    too lazy to update time
**/
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define nn "\n"
#define pb push_back
#define all(a) a.begin(), a.end()

const int N = 1e5 + 5;

int n, a[N];

void nhap(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
}

void solve(){
    vector<int> lis;

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

        int pos = lower_bound(all(lis), a[i]) - lis.begin();

        if(pos == lis.size()){
            lis.pb(a[i]);
        }
        else{
            lis[pos] = a[i];
        }
    }

    cout << lis.size() << nn;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    nhap();
    solve();

    return 0;
}