#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100005], d[100005], p[100005], nr=0, MAX=0;
int q;
int main()
{
    int n;  fin >> n;
    for(int i=1; i<=n; i++)   fin >> v[i];
    for(int i=1; i<=n; i++)
    {
        if(nr==0 || v[i]>d[nr]){ nr++;  d[nr]=v[i]; p[nr]=p[nr-1]+1;}
        else
        {
            q=lower_bound(d+1, d+nr+1, v[i])-d;
            d[q]=v[i];
        }
        if(p[nr]>MAX)   MAX=p[nr];
    }
    fout << MAX;
    return 0;
}