#include <iostream>
#include <array>
#include <algorithm>
#include <fstream>

using namespace std;

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

int max_subseq(int *arr, int n){
    int N = n;
    int DP[100000];
    DP[0] = 1;

    for(int i = 1; i < N; ++i){
        DP[i] = 1;
        for(int j = 0 ; j < i; ++j)
            if(arr[i] > arr[j])
                if(DP[j] + 1 > DP[i])
                  DP[i] = DP[i] + 1;
    }
    int maxim = 0;
    for(int i = 0; i < N; ++i)
        maxim = max(maxim,DP[i]);
    return maxim;
}

int main(void){
    int arr[100000];
    
    int n = 0;
    
    f >> n;
    
    for(int i = 0; i < n; ++i)
       f >> arr[i];
    
    g << max_subseq(arr,n);
}