N = int(input())
A = list(map(int,input().split()))
X = 0
flg = 0
p = [0]*N
if N <= 2:
  print(0)
  exit()
p1,p2 = 0,0
for i in range(1,N):
  if A[i-1] < A[i]:
    p[i] = 1
    if p1 == 0:
      p1 += 1
    if p2 == 1:
      p1 += 1
  elif A[i-1] > A[i]:
    p[i] = -1
    if p2 == 0:
      p2 += 1
    if p1 == 1:
      p2 += 1
if p1+p2 > 2:
  print(min(p.count(1),p.count(-1)))
  exit()

p[0] = p[1]
lc,lr = 0,0

for i in range(1,N):
  if p[i] == p[i-1] and flg == 0:
    lc += 1
  elif p[i] == p[i-1] and flg == 1:
    lr += 1
  else:
    X = max(X,min(lc,lr)+1)
    if flg == 0:
      flg = 1
      lr = 0
    else:
      flg = 0
      lc = 0
X = max(X,min(lc,lr))
if p.count(1) == 0 or p.count(-1) == 0:
  print(0)
else:
  print(X)