#include <bits/stdc++.h>
using namespace std;
int v[5005];
int l[5005];
int dp[5005];
int main()
{
    freopen("subsir2.in","r",stdin);
    freopen("subsir2.out","w",stdout);
    int n,i,j,k,st,dr;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&v[i]);
    dp[n]=1;
    int max1=1;
    for(i=n-1;i>0;i--)
    {
     for(j=i+1;j<=n;j++)
     {
         if(v[i]>v[j])break;
         if(v[i]==v[j])
         {
             if((dp[j]+1)>dp[i])dp[i]=dp[j]+1;
             max1=max(max1,dp[i]);
             break;
         }
         dp[i]=max(dp[i],dp[j]+1);
         max1=max(max1,dp[i]);
     }
    }
    printf("%d\n",max1);
    return 0;
}