#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <memory>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

vector<int> A;
vector<vector<int> > memo[2];

int recL(int i, int j);
int recR(int i, int j);

int recL(int i, int j) {
	int &r = memo[0][i][j];
	if(r != -1) return r;
	if(i == j) return r = 0;
	r = 0;
	if(A[i] < A[j])
		amax(r, 1 + recR(i+1, j));
	amax(r, recL(i, j-1));
	return r;
}
int recR(int i, int j) {
	int &r = memo[1][i][j];
	if(r != -1) return r;
	if(i == j) return r = 0;
	r = 0;
	if(A[i] > A[j])
		amax(r, 1 + recL(i, j-1));
	amax(r, recR(i+1, j));
	return r;
}

int main() {
	int N;
	scanf("%d", &N);
	A.resize(N);
	rep(i, N) scanf("%d", &A[i]);
	rep(k, 2)
		memo[k].assign(N+1, vector<int>(N+1, -1));
	int ans = 0;
	rep(i, N) amax(ans, 1 + recL(i, N-1));
	rep(i, N) amax(ans, 1 + recR(0, i));
	printf("%d\n", ans);
	return 0;
}