#include <iostream>
#include  <cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<climits>
using namespace std;
long long dp[26];
long long a[26];
int main(){
    int k ;
    cin >> k;
    for(int i = 1;i <= k;i++){
        cin >> a[i];
        dp[i] = 1;
    }
    long long maxx = 0;

    for(int i = 1;i <= k;i++){
        for(int j = 1;j < i;j++){
            if(a[j] >= a[i]){
                dp[i] = max(dp[i],dp[j]+1);
                maxx = max(dp[i],maxx);
            }
        }
    }
    cout << maxx <<endl;

}