#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
    ll n;
    cin>>n;
    vector<ll> h(n+2);
    vector<int> l(n+1),r(n+1);
    h[0]=LLONG_MAX;
    h[n+1]=LLONG_MAX;
    for (int i=1;i<=n;i++) cin>>h[i];
    stack<int> mx;
    mx.push(0);
    for (int i=1;i<=n;i++){
        while (!mx.empty() && h[mx.top()]<=h[i]) mx.pop();
        l[i]=mx.top();
        mx.push(i);
    }
    stack<int> mx2;
    mx2.push(n+1);
    for (int i=n;i>=1;i--){
        while (!mx2.empty() && h[mx2.top()]<=h[i]) mx2.pop();
        r[i]=mx2.top();
        mx2.push(i);
    }

    ll ans=0;
    stack<int> st;
    st.push(0);
    for (int i=1;i<=n;i++){
        int last=-1;
        while (!st.empty() && h[st.top()]<=h[i]) {last=st.top();st.pop();}
        st.push(i);
        if (last==-1 || h[last]!=h[i]) continue;
        int left=l[last]+1;
        int right=r[i]-1;

        ll cur=i-last+1;
        if (last-left<right-i){
            cur+=2*(last-left);
            int mid = (last+i)/2;
            int push = (i-mid)*2-1;
            if (mid*2!=last+i) push++;
            cur+=min(right-i, push);
        }
        else {
            cur+=2*(right-i);
            int mid = (last+i)/2;
            int push = (mid-last)*2-1;
            if (mid*2!=last+i) push++;
            cur+=min(last-left, push);
        }
        ans=max(ans, cur);
    }
    cout<<ans;
}