#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,d1=0,d2=0,s1[100010],s2[100010],a[100010],ans=0; 
int main()
{
    freopen("tahort.in","r",stdin);
    freopen("tahort.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		while(d1!=0&&a[s1[d1]]>=a[i]) d1--;
		while(d2!=0&&a[s2[d2]]<a[i]) d2--;
		int k=upper_bound(s1+1,s1+1+d1,s2[d2])-s1;
		if(k!=(d1+1))
        {
           if(ans<i-s1[k]+1) ans=i-s1[k]+1;
        }
        d1++;
        d2++;
		s1[d1]=i;
		s2[d2]=i;
	}
	printf("%lld",ans);
	return 0;
}