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

int dp[3000][3000][2];

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][0] = dp[i][j][1] = -INF;
		}
		dp[i][i][0] = dp[i][i][1] = 1;
	}

	for (int k = 0; k < N; k++)
	{
		for (int i = k; i < N; i++)
		{
			int j = i - k;
			if (j != 0){
				if (A[i] > A[j - 1]){
					dp[i][j - 1][1] = max(dp[i][j][0] + 1, dp[i][j - 1][1]);
				}
				dp[i][j - 1][0] = max(dp[i][j][0], dp[i][j - 1][0]);

			}
			if (i != N - 1){
				if (A[j] > A[i + 1]){
					dp[i + 1][j][0] = max(dp[i][j][1] + 1, dp[i + 1][j][0]);
				}
				dp[i + 1][j][1] = max(dp[i][j][1], dp[i + 1][j][1]);
			}
			ans = max(ans, dp[i][j][0]);
			ans = max(ans, dp[i][j][1]);
		}
	}

	cout << ans << endl;
}