n = int(eval(input()))

h = list(map(int, input().split()))



higher = [0]

move = [0]



for i in range(1, n):

  if h[i-1] < h[i]:

    m = i - higher[len(higher) - 1] - 1

    move.append(m)

    higher.append(i)



move.append(len(h) - 1 - higher[len(higher) - 1])





print((max(move)))
n = int(eval(input()))

h = list(map(int, input().split()))



move = [0]

cnt = 0



for i in range(n-1):

  if h[i] >= h[i+1]:

    cnt += 1

    if i == n-2:

      move.append(cnt)

  else:

    move.append(cnt)

    cnt = 0





print((max(move)))
n = int(eval(input()))
h = list(map(int, input().split()))
higher = [0]
move = [0]
for i in range(1, n):
    if h[i - 1] < h[i]:
        m = i - higher[len(higher) - 1] - 1
        move.append(m)
        higher.append(i)
move.append(len(h) - 1 - higher[len(higher) - 1])
print((max(move)))

n = int(eval(input()))
h = list(map(int, input().split()))
move = [0]
cnt = 0
for i in range(n - 1):
    if h[i] >= h[i + 1]:
        cnt += 1
        if i == n - 2:
            move.append(cnt)
    else:
        move.append(cnt)
        cnt = 0
print((max(move)))

-higher = [0] -for i in range(1, n): -    if h[i - 1] < h[i]: -        m = i - higher[len(higher) - 1] - 1 -        move.append(m) -        higher.append(i) -move.append(len(h) - 1 - higher[len(higher) - 1]) +cnt = 0 +for i in range(n - 1): +    if h[i] >= h[i + 1]: +        cnt += 1 +        if i == n - 2: +            move.append(cnt) +    else: +        move.append(cnt) +        cnt = 0