#include <bits/stdc++.h>

using namespace std;

const int lim = 2000;

vector<int> arr;
vector<int> length;
//vector<int> ready;

ifstream in("scmax.in");
ofstream out("scmax.out");

int main()
{
    int n;
    in >> n;

    arr.resize(n);
    length.resize(n);
    //ready.resize(n);
    for (int i = 0; i < n; i++)
    {
        in >> arr[i];
    }

    for (int k = 0; k < n; k++)
    {
        length[k] = 1;
        for (int i = 0; i < k; i++)
        {
            if (arr[i] < arr[k])
                length[k] = max(length[k], length[i]+1);  
        }
    }

    sort(length.begin(), length.end()); 
    out << length[n - 1];

    return 0;
}