from bisect import bisect_left

N = int(input())
A1 = list(map(int, input().split()))
maxa = max(A1)
A2 = []
for i in range(N):
    A2.append(maxa - A1[i])
A = [A1,A2]
ans = 0
for j in range(2):
    dp2 = [[0] * N for _ in range(2)]
    for k in range(2):
        if k == 0:
            dp = [A[j][0]]
        else:
            dp = [A[j][-1]]
        now = 1
        for i in range(N):
            if k == 1:
                i = N - i - 1
            a = A[j][i]
            if a > dp[-1]:
                dp.append(a)
                now += 1
            else:
                dp[bisect_left(dp, a)] = a
            dp2[k][i] = now
    for i in range(N):
        if dp2[0][i] == dp2[1][i]:
            ans = max(ans, dp2[0][i] - 1)
print(ans)