#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

const int MAXN = 3010;
int A[MAXN];
int dpL[MAXN][MAXN];
int dpR[MAXN][MAXN];

int main(void) {
    int N;
    int ret = 1;
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (int i = 0; i < MAXN; i++) for (int j = 0; j < MAXN; j++) {
        dpL[i][j] = dpR[i][j] = 1;
    }
    for (int w = 1; w < N; w++) {
        for (int x = 0; x+w < N; x++) {
            dpL[x][x+w] = max(dpL[x][x+w], dpL[x][x+w-1]);
            dpR[x][x+w] = max(dpR[x][x+w], dpR[x][x+w-1]);
            if (A[x] < A[x+w]) {
                dpL[x][x+w] = max(dpL[x][x+w], 1 + dpR[x+1][x+w]);
            }
            if (A[x] > A[x+w]) {
                dpR[x][x+w] = max(dpR[x][x+w], dpL[x][x+w-1]+1);
            }
            ret = max(ret, max(dpL[x][x+w], dpR[x][x+w]));
        }
    }
    cout << ret << endl;
    return 0;
}