#include <bits/stdc++.h>
using namespace std;
int main() {
    int N;cin>>N;int M=1;
    vector<long long>V(N);
    vector<long long>L(0);
    for(int X=0;X<N;X++){
        cin>>V[X];
        if(X>1){
            if((V[X-1]-V[X])==0){
                L.push_back(M);M=0;
            }
          else if((V[X-1]-V[X]>0&&V[X-2]-V[X-1]>=0)||(V[X-1]-V[X]<0&&V[X-2]-V[X-1]<=0))M++;
            else if((V[X-1]-V[X]>0&&V[X-2]-V[X-1]<=0)||(V[X-1]-V[X]<0&&V[X-2]-V[X-1]>=0)){
                L.push_back(M);M=1;
            }
        }
        if(X==1){
            if(V[X]==V[X-1])int M=0;
            else int M=1;
        }
      if(X==N-1){
        if(M!=0)L.push_back(M);
      }
    }
    long long U=0;
    for(int X=1;X<L.size();X++){
        if(U<min(L[X],L[X-1]))U=min(L[X],L[X-1]);
    }
    cout<<U<<endl;
}