#include <bits/stdc++.h> using namespace std; int n,a[10000],f[10000],m[10000],p[10000]; int maxn = 0; int c; int final; void print(int x,int k) { p[k] = a[x]; //cout << a[x] << " "; if(k == maxn) { return; } print(m[x],k+1); return; } int main() { cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; } f[1]=1; for(int i = 2; i <= n; i++) { f[i] = 1; for(int j = 1; j < i; j++) { if(a[i]>=a[j]) { //f[i] = max(f[i],f[j]+1); if(f[j]+1>=f[i]) { f[i] = f[j]+1; c = j; } } } m[i] = c; //maxn = max(f[i],maxn); if(f[i] >= maxn) { maxn = f[i]; final = i; } } cout << maxn << endl; return 0; }