#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

void solve() {
    int n;
    cin >> n;
    vi a(n);
    rep(i, n) cin >> a[i];
    vector dp(n, vi(n + 1));
    vector ep(n, vi(n + 1));
    REP(len, 1, n + 1) {
        for (int x = 0; x + len <= n; ++x) {
            int y = x + len;
            if (len == 1) {
                dp[x][y] = 1;
                ep[x][y] = 1;
                continue;
            }
            chmax(dp[x][y], dp[x][y - 1]);
            chmax(ep[x][y], ep[x + 1][y]);
            if (a[x] < a[y - 1]) chmax(dp[x][y], ep[x + 1][y] + 1);
            if (a[x] > a[y - 1]) chmax(ep[x][y], dp[x][y - 1] + 1);
        }
    }
    int ans = 0;
    rep(i, n) REP(j, i + 1, n + 1) {
        chmax(ans, dp[i][j]);
        chmax(ans, ep[i][j]);
    }
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // multi-testcase
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}