#include<bits/stdc++.h>
using namespace std;
int n,a[1000005],maxx[1000005],minn[1000005],aindex,bindex;
int main()
{
    freopen("tahort.in","r",stdin);
    freopen("tahort.out","w",stdout);
	int ans=0;
    scanf("%d",&n);
    for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
    for(int i = 1;i<=n;i++){
    while(aindex&&a[maxx[aindex]]<=a[i]) aindex--;
    while(bindex&&a[minn[bindex]]>=a[i]) bindex--;
    int x=upper_bound(minn+1,minn+bindex+1,maxx[aindex])-minn;
    if(x!=bindex+1){
        ans=max(ans,i-minn[x]+1);
    }
    minn[++bindex]=maxx[++aindex]=i;
    }
    printf("%d",ans);
    return 0;
}