// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,h[maxn],lt[maxn],rt[maxn],ans;
vector<int> edge[maxn];

int dp[maxn],dep[maxn];
void dfs(int u){
    int Max=0;
    for(int v:edge[u]){
        dep[v]=dep[u]+1;dfs(v);
        Max=max(Max,dp[u]+dp[v]+1);
        dp[u]=max(dp[u],dp[v]+1);
    }
    ans=max(ans,Max+dep[u]);
}



void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> h[i];
    vector<int> v;
    for(int i=1;i<=n;i++){
        while(!v.empty() && h[v.back()]<h[i]) v.pop_back();
        lt[i]=(v.empty()?1:v.back()+1);
        v.push_back(i);
    }
    v.clear();
    for(int i=n;i>=1;i--){
        while(!v.empty() && h[v.back()]<h[i]) v.pop_back();
        rt[i]=(v.empty()?n:v.back()-1);
        v.push_back(i);
    }
    map<pii,int> mp;
    for(int i=1;i<=n;i++){
        mp[{lt[i],rt[i]}]=i;
        //cout << lt[i] << ' ' << rt[i] << '\n';
    }
    for(int i=1;i<=n;i++){
        if(lt[i]<i) edge[i].push_back(mp[{lt[i],i-1}]);
        if(i<rt[i]) edge[i].push_back(mp[{i+1,rt[i]}]);
    }
    int root=max_element(h+1,h+n+1)-h;
    dfs(root);
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}