#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
vector<int> v;
int n,x,rez;
int longestIncreasingSubsequence(vector<int>& nums) {
    int n = nums.size();
    if (n == 0) return 0;

    vector<int> dp(n, 1);
int max_length=0;
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (nums[i] > nums[j] && dp[i] < dp[j] + 1) {
                dp[i] = dp[j] + 1;
                max_length=max(max_length,dp[i]);
            }
        }
    }

  //  int max_length = *max_element(dp.begin(), dp.end());

    return max_length;
}
int main() {
fin>>n;
for(int i=1;i<=n;i++){
    fin>>x;
    v.push_back(x);
}
rez=longestIncreasingSubsequence(v);
fout<<rez;

    return 0;
}