#include <bits/stdc++.h>
#define pas (i&(-i))
//https://www.geeksforgeeks.org/longest-increasing-subsequence-using-bit/
using namespace std;
int dp[100005];
int v [100005];
int succ[100005];
int aib[100005];
set <pair<int, int>> s;
int n;
void compress()
{
    for (int i=1; i<=n; i++) {
        s.insert({v[i], i});
    }
    int i=1, prev=-1;
    for (auto it=s.begin(); it!=s.end(); it++) {
        pair <int, int> p=*it;
        if (p.first==prev) {
            v[p.second]=i-1;
        }
        else {
           v[p.second]=i;
           i++;
        }
        prev=p.first;
    }
    s.clear();
}
int query (int poz)
{
    int maxi=0;
    for (int i=poz; i>0; i-=pas) {
        maxi=max(maxi, aib[i]);
    }
    return maxi;
}
void update (int poz)
{
    int val=query(poz-1)+1;
    for (int i=poz; i<=n; i+=pas) {
        aib[i]=max(aib[i], val);
    }
}

/*
Subproblema: cel mai lung subsir
crescator maximal care incepe cu pozitia i.
*/
int main()
{
    cin.tie(0); cin.sync_with_stdio(false);
    cout.tie(0); cout.sync_with_stdio(false);
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    int elem;
    cin>>n;
    for (int i=1; i<=n; i++) cin>>v[i];
    compress();
    //for (int i=1; i<=n; i++) cout<<v[i]<<' ';
    //cout<<endl;
    for (int i=1; i<=n; i++) {
        update(v[i]);
    }
    int sol=query(n);
    cout<<sol;
    /*
    for (int i=n; i>=1; i--) {
        dp[i]=0;
        for (int j=i+1; j<=n; j++) {
            if (v[j]>v[i]&&dp[j]>dp[i]) {
                dp[i]=dp[j];
                succ[i]=j;
            }
        }
        dp[i]++;
    }
    int maxi=-1, poz=0;
    for (int i=1; i<=n; i++) {
        if (dp[i]>maxi) {
            maxi=dp[i];
            poz=i;
        }
    }
    cout<<maxi<<'\n';
    while (succ[poz]!=0) {
        cout<<v[poz]<<' ';
        poz=succ[poz];
    }
    cout<<v[poz]<<' ';
    */
    return 0;
}