#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include<set>
#include<math.h>
using namespace std;




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

    vector<int>v(n);

    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }


    vector<int>dp(n);
    dp[0] = 1;
    int res = 1;
    for (int i = 1; i < n; i++) {
        dp[i] = 1;
        for (int j = 0; j < i; j++) {
            if (v[i] > v[j]) {
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
        res = max(res, dp[i]);
    }
    cout << res;
}