#include <fstream>
using namespace std;

int N, a[100002], L[100002], lmax;

int main()
{
    f>>N; a[0]=200000000; L[N]=1;
    for (int i=N-1; i>0; --i)
        for (int j=i+1; j<=N; ++j)
            if (v[i]<v[j] && L[j]+1<=L[i])
            {
                L[j]=L[i];
                if (lmax<L[j]) lmax=L[j];
            }
    g<<lmax<<'\n';
    return 0;
}