n = int(input())
A = list(map(int, input().split()))

# Remove adjacent duplicates
B = []
for num in A:
    if not B or num != B[-1]:
        B.append(num)
m = len(B)

if m < 3:
    print(0)
else:
    inc = 1  # length of the longest zigzag ending with an increase
    dec = 1  # length of the longest zigzag ending with a decrease
    for i in range(1, m):
        if B[i] > B[i-1]:
            new_inc = dec + 1
            new_dec = dec
        elif B[i] < B[i-1]:
            new_dec = inc + 1
            new_inc = inc
        else:
            # This case is redundant since B has no duplicates
            new_inc = inc
            new_dec = dec
        inc, dec = new_inc, new_dec
    max_len = max(inc, dec)
    print(max_len if max_len >= 3 else 0)