#include "bits/stdc++.h"
using namespace std;

int dp[3000][3000];

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
	}

	int ans = 0;

	int INF = 9999999;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			dp[i][j] = -INF;
		}
		dp[i][i] = 1;
	}

	for (int i = 0; i < N; i++)
	{
		for (int j = i; j >= 0; j--)
		{
			if (dp[i][j] < 0) continue;
			if (dp[i][j] % 2 == 0 && j != 0){
				int add = 0;
				if (A[i] > A[j - 1]) add++;
				dp[i][j - 1] = max(dp[i][j] + add, dp[i][j - 1]);
			}
			else if (dp[i][j] % 2 == 1 && i != N - 1){
				int add = 0;
				if (A[j] > A[i + 1]) add++;
				dp[i + 1][j] = max(dp[i][j] + add, dp[i + 1][j]);
			}
			ans = max(ans, dp[i][j]);
		}
	}

	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			dp[i][j] = -INF;
		}
		dp[i][i] = 1;
	}

	for (int i = 0; i < N; i++)
	{
		for (int j = i; j >= 0; j--)
		{
			if (dp[i][j] < 0) continue;
			if (dp[i][j] % 2 == 1 && j != 0){
				int add = 0;
				if (A[i] > A[j - 1]) add++;
				dp[i][j - 1] = max(dp[i][j] + add, dp[i][j - 1]);
			}
			else if (dp[i][j] % 2 == 0 && i != N - 1){
				int add = 0;
				if (A[j] > A[i + 1]) add++;
				dp[i + 1][j] = max(dp[i][j] + add, dp[i + 1][j]);
			}
			ans = max(ans, dp[i][j]);
		}
	}
	cout << ans << endl;
}