#include <bits/stdc++.h>
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
int i,j,n,a[1000],k,sir[1000],v[1000],maxim;
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>a[i];

    for(i=1;i<=n;i++)
        for(j=0;j<=i-1;j++){
        if(a[i]>a[j] && v[i]<=v[j]+1)
        v[i]=v[j]+1;
        if(maxim<v[i])
            maxim=v[i];
        }

    fout<<maxim;
    return 0;
}