using namespace std;                                                                                   
long long MAX_N=1005;                                                                         
int main(){                                   
    freopen("stake.in","r",stdin);
    freopen("stake.out","w",stdout);                                  
    int dp[MAX_N], a[MAX_N], n;
    cin>>n;
    int ans=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        dp[i]=1;
        for(int j=1;j<i;j++){
            if(a[j]>=a[i]){
                dp[i]=max(dp[i],dp[j]+1);
                }
        }
        ans=max(ans,dp[i]);
    }
    cout<<ans;
    return 0;
}