maxposl

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    int n, c;
    cin >> n;
    vector <int> dp;
    vector <int> a;
    for(int i = 0; i < n; i++){
        cin >> c;
        a.push_back(c);
        dp.push_back(1);
    }
    for(int i = 0; i < a.size(); i++){
        for(int j = i + 1; j < a.size(); ++j){
            if(a[i] < a[j] && dp[j] <= dp[i])
                dp[j] = dp[i] + 1;
        }
    }
    sort(dp.begin(),dp.end());
    cout << dp[n - 1];
    return 0;
}