#include<bits/stdc++.h>
using namespace std;
int n,m,a[10000],o[10000]={1},ans=0;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		o[i]=1;
		m=0;
	
		for(int j=i;j>1;j--){
			if(a[i]<=a[j-1]&&o[i]+o[j-1]>m){
				m=o[i]+o[j-1];
			}
		}
		o[i]=m;
		
	}
	for(int i=1;i<=n;i++){
		ans=max(ans,o[i]);
	}
	cout<<ans+1;
	return 0;
}

/**************************************************************
	Problem: 1795
	User: zhengzihao
	Language: C++
	Result: Accepted
	Time:18 ms
	Memory:2152 kb
****************************************************************/