?

#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int a[N],d[N],n;

int main(){
cin >> n;
for(int i = 1;i <= n;i++) cin >> a[i];
for(int i = 1;i <= n;i++){
d[i] = 1;
for(int j = 1;j < i;j++){
if(a[j] >= a[i]){
d[i] = max(d[j] + 1,d[i]);
}
}
}
sort(d+1,d+n+1);
cout << d[n];
return 0;
}