#include <iostream>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
template <typename T> bool setmax(T & l, T const & r) { if (not (l < r)) return false; l = r; return true; }
using namespace std;
int main() {
    int n; cin >> n;
    vector<int> a(n); repeat (i,n) cin >> a[i];
    vector<vector<vector<int> > > dp(2, vector<vector<int> >(n, vector<int>(n)));
    repeat (len,n+1) {
        repeat (l,n) {
            int r = l + len;
            if (n <= r) continue;
            if (l == r) {
                dp[0][l][r] = 1;
                dp[1][l][r] = 1;
            } else {
                dp[0][l][r] = dp[0][l][r-1];
                dp[1][l][r] = dp[1][l+1][r];
                if (a[l] < a[r]) setmax(dp[0][l][r], dp[1][l+1][r] + 1);
                if (a[l] > a[r]) setmax(dp[1][l][r], dp[0][l][r-1] + 1);
            }
        }
    }
    int ans = 0;
    repeat (j,n) setmax(ans, max(dp[0][j][n-1], dp[1][0][j]));
    cout << ans << endl;
    return 0;
}