#include<iostream>
#include<algorithm>
using namespace std;
int n,a[1005],f[1005],g[1005],i,j,ans=0;
int main()
{
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
for(i=0;i<n;i++){
f[i]=1;
for(j=0;j<i;j++)if(a[i]>a[j])f[i]=max(f[i],f[j]+1);
}
for(i=n-1;i>=0;i--){
g[i]=1;
for(j=n-1;j>i;j--)if(a[i]>a[j])g[i]=max(g[i],g[j]+1);
}
for(i=0;i<n;i++)ans=max(ans,f[i]+g[i]-1);
printf("%d\n",ans);
return 0;
}