#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");

unsigned long long Lmax (unsigned long long a[],unsigned long long N)
{
    unsigned long long dp[N+1],i,j,maxim=0;
    for (i=1;i<=N;++i)
    {
        dp[i]=1;
    }
    for (i=1;i<=N;++i)
    {
        for (j=1;j<i;++j)
        {
            if (a[j]<a[i])
            {
                dp[i]=max(dp[i],dp[j]+1);
            }
        }
    }
    sort(dp+1,dp+N+1);
    return dp[N];
}

int main()
{
    unsigned long long N,a[100001],i;
    fin >> N;
    for (i=1;i<=N;++i)
    {
        fin >> a[i];
    }
    fout << Lmax(a,N);
    return 0;
}