#include<iostream>#include<stdio.h>#include<stdlib.h>#include<vector>#include<stack>#include<string.h>#include<map>#include<math.h>#include<queue>#include<set>#include<algorithm>#define MAX 0x3f3f3f3ftypedeflonglong ll;usingnamespace std;int n,m,k;int a[26];int dp[26];intmain(){
cin>>n;for(int i =0; i < n ; i++)
cin>>a[i];int ans =-1;for(int i =0; i < n ; i++){
dp[i]=1;for(int j =0; j < i ; j++){
if(dp[j]+1> dp[i]&& a[j]>= a[i])
dp[i]= dp[j]+1;}
ans =max(ans,dp[i]);}
cout<<ans;return0;}