#include<iostream>

#include<cstdio>

#include<queue>

#include<algorithm>

#include<cmath>

#include<ctime>

#include<set>

#include<map>

#include<stack>

#include<cstring>

#define inf 2147483647

#define ls rt<<1

#define rs rt<<1|1

#define lson ls,nl,mid,l,r

#define rson rs,mid+1,nr,l,r

#define N 100010

#define For(i,a,b) for(int i=a;i<=b;i++)

#define p(a) putchar(a)

#define g() getchar()

using namespace std;

int a[N],b[N],n,len;

void in(int &x){

    int y=;

    char c=g();x=;

    while(c<''||c>''){

        if(c=='-')y=-;

        c=g();

    }

    while(c<=''&&c>=''){

        x=(x<<)+(x<<)+c-'';c=g();

    }

    x*=y;

}

void o(int x){

    if(x<){

        p('-');

        x=-x;

    }

    if(x>)o(x/);

    p(x%+'');

}

int main(){

    in(n);

    For(i,,n)in(a[i]);

    len=;

    b[]=a[];

    For(i,,n){

        if(a[i]>=b[len])b[++len]=a[i];

        else{

            int x=upper_bound(b+, b+len+, a[i])-b;

             b[x]=a[i];

        }

//            b[upper_bound(b+1, b+len+1, a[i])-b-1]=a[i];

    }

    o(len);

    return ;

}