/* -*- coding: utf-8 -*-
 *
 * 127.cc: No.127 門松もどき - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 3000;
const int INF = 1 << 30;

/* typedef */

/* global variables */

int as[MAX_N];
int dpl[MAX_N][MAX_N], dpr[MAX_N][MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> as[i];

  for (int i = 0; i < n; i++) dpl[i][i] = dpr[i][i] = 1;

  for (int k = 1; k < n; k++) {
    for (int l = 0, r = k; r < n; l++, r++) {
      dpl[l][r] =
	(as[l] >= as[r]) ?
	dpl[l][r - 1] : max(dpl[l][r - 1], dpr[l + 1][r] + 1);
      dpr[l][r] =
	(as[l] <= as[r]) ?
	dpr[l + 1][r] : max(dpr[l + 1][r], dpl[l][r - 1] + 1);
    }
  }

  printf("%d\n", max(dpl[0][n - 1], dpr[0][n - 1]));
  return 0;
}