#include <cstdio>
#include <algorithm>
using std::max;
int main(void)
{
int i,j,N,maxVal,*h,*dp;
scanf("%d",&N);
dp=new int [N];
h=new int [N];
maxVal=0;
for(i=0;i<N;i++)
{
scanf("%d",h+i);
dp[i]=1;
for(j=i-1;j>=0;j--)
{
if(h[j]>=h[i])
dp[i]=max(dp[j]+1,dp[i]);
}
maxVal=max(dp[i],maxVal);
}
printf("%d\n",maxVal);
delete [] h;
delete [] dp;
return 0;
}