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

int L(vector<int>&nums) {
    int n = nums.size();
    vector<int> dp(n, 1);;
    for (int i = 1; i < n; i++) 
        for (int j = 0; j < i; j++) 
            if (nums[i] > nums[j])dp[i] = max(dp[i], dp[j]);
        
    return *max_element(dp.begin(), dp.end());
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    cout << L(a);
    return 0;
}

题目是B3637，求最短序列