#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void show(vector< vector<int> > &);

vector< vector<int> > dpL, dpR;

int main() {
	vector<int> a;
	int n;

	cin >> n;
	a.assign(n, 0);

	int input;
	for (int i = 0; i < n; i++) {
		cin >> input;
		a[i] = input;
	}

	dpL.assign(n, vector<int>(n, 0));
	dpR = dpL;

	for (int i = 0; i < n; i++) {
		dpR[i][i] = 1;
		dpL[i][i] = 1;
	}

	for (int diff = 1; diff < n; diff++) {
		for (int left = 0; left < n; left++) {
			int right = left + diff;
			if (right >= n) {
				break;
			}

			if (a[left] >= a[right]) {
				dpL[left][right] = dpL[left][right - 1];
			} else {
				dpL[left][right] = max(dpL[left][right - 1], dpR[left + 1][right] + 1);
			}

			if (a[right] >= a[left]) {
				 dpR[left][right] = dpR[left + 1][right];
			} else {
				 dpR[left][right] = max(dpR[left + 1][right], dpL[left][right - 1] + 1);
			}
		}
	} 

	cout << max(dpL[0][n - 1], dpL[0][n - 1]);

	// cout << endl << endl << "dpL" << endl;;
	// show(dpL);
	// cout << endl << "dpR" << endl;
	// show(dpR);

	return 0;
}

void show(vector< vector<int> > &vec2) {
	int n = vec2.size();
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			printf("%2d ", vec2[i][j]);
		}
		cout << endl;
	}
	cout << endl;
}