#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;

    std::vector<int> h(n), invh(n);
    for (int i = 0; i < n; i++) {
        std::cin >> h[i];
        h[i]--;
        invh[h[i]] = i;
    }

    std::vector<int> l(n, -1), r(n, -1);
    std::vector<int> stk;
    for (int i = 0; i < n; i++) {
        while (!stk.empty() && h[i] > h[stk.back()]) {
            r[stk.back()] = i;
            stk.pop_back();
        }
        if (!stk.empty()) {
            l[i] = stk.back();
        }
        stk.push_back(i);
    }

    std::vector<int> dpl(n), dpr(n), dp(n), dep(n);
    for (int i = n - 2; i >= 0; i--) {
        int x = invh[i];
        if (l[x] != -1) {
            dep[x] = std::max(dep[x], dep[l[x]] + 1);
        }
        if (r[x] != -1) {
            dep[x] = std::max(dep[x], dep[r[x]] + 1);
        }
    }
    int ans = 0;
    for (auto i : invh) {
        dp[i] = std::max(dpl[i], dpr[i]);
        ans = std::max(ans, dpl[i] + dpr[i] + dep[i]);
        if (l[i] != -1) {
            dpl[l[i]] = std::max(dpl[l[i]], dp[i] + 1);
        }
        if (r[i] != -1) {
            dpr[r[i]] = std::max(dpr[r[i]], dp[i] + 1);
        } 
    }
    std::cout << ans << "\n";
    
    return 0;
}