#include<iostream>
#include<algorithm>
using namespace std;
int dp[1010];   //dp[i]=j 表示a[1]~a[i]的最长非降子序列的长度
int a[1010];
int n;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }
    int res = 0;
    for (int i = 1; i <= n; i++){//状态转移方程 dp[i]=max{dp[i],dp[j]+1},限制条件 j<i,a[j]<=a[i]
        dp[i] = 1;                  //dp[i]=1 (1~n)
        for (int j = 1; j < i; j++){   //保证了j<i
            if (a[j] <= a[i])          //保证了a[i]<=a[j]
                dp[i] = max(dp[i],dp[j]+1);  
        }
        res = max(dp[i], res);
    }
    cout << res << endl;
    return 0;
}