#include <iostream>
#include <algorithm>
using namespace std;

int main(int argc, char* argv[])
{
    int N;
    scanf("%d", &N);

    int num[1000];
    for (int i = 0; i < N; ++i)scanf("%d", &num[i]);

    int DP[1000];    
    fill(&DP[0], &DP[N], 1);

    for (int i = 1; i < N; ++i)
        for (int j = 0; j < i; ++j)
            if (num[j] < num[i]) DP[i] = max(DP[j] + 1, DP[i]);

    cout << *max_element(&DP[0], &DP[N])<<endl;

    return 0;
}