#include <bits/stdc++.h>

using namespace std;

int n, v[1001], k;
int dp[1001];
///dp[i] -> subsir maximal care are ca ultim element v[i], cu lungimea j

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> v[i];
    dp[++k] = v[1];
    for(int i = 2; i <= n; i ++)
    {
        if(v[i] > dp[k])
            dp[++k] = v[i];
        else
        {
            if(dp[k] > v[i])
            {
                int st = 1, dr = k, poz = 0;
                while(st <= dr)
                {
                    int mijloc = (st+dr) / 2;
                    if(dp[mijloc] > v[i])
                    {
                        poz = mijloc;
                        dr = mijloc - 1;
                    }
                    else
                        st = mijloc + 1;
                }
                dp[poz] = v[i];
            }
        }
    }
    cout << k << '\n';
}