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