#include<bits/stdc++.h>
using namespace std;
struct node{
    int l,r;
}a[100005],b[100005];
int n,c[100005],ans,j;
int main(){
    freopen("tahort.in","r",stdin);
    freopen("tahort.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&c[i]);
        a[i].l=a[i].r=b[i].l=b[i].r=i;
    }
    for(int i=1;i<=n;i++){
        j=i+1;
        while(true){
            if(c[i]<c[j]){
                a[i].r=j;
                j++;
            }else{
                break;
            }
        }
    }
    for(int i=n;i>=1;i--){
        j=i-1;
        while(true){
            if(c[i]>c[j]){
                b[i].l=j;
                j--;
            }else{
                break;
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(a[i].r==i) continue;
        for(int k=i;k<=n;k++){
            if(b[k].l==k) continue;
            if((a[i].l==b[k].l)&&a[i].r==b[k].r){
                ans=max(ans,a[i].r-a[i].l+1);
            }else if(a[i].r==b[k].r){
                ans=max(ans,min(a[i].r-a[i].l+1,b[k].r-b[k].l+1));
            }
        }
    }
    printf("%d",ans);
    return 0;
}