n = int(eval(input()))

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

temp = 0

cnt = 0



for i in range(n-1):

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

    temp += 1

    cnt = max(cnt, temp)

  else:

    temp = 0



print(cnt)
n, *h = list(map(int, open(0).read().split()))

left = h[0]

ans = 0

cnt = 0

for i in range(1,n):

    if left >= h[i]:

        cnt += 1

    else:

        ans = max(ans, cnt)

        cnt = 0

    left = h[i]

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

n, *h = list(map(int, open(0).read().split()))
left = h[0]
ans = 0
cnt = 0
for i in range(1, n):
    if left >= h[i]:
        cnt += 1
    else:
        ans = max(ans, cnt)
        cnt = 0
    left = h[i]
print((max(ans, cnt)))

-n = int(eval(input())) -hs = list(map(int, input().split())) -temp = 0 +n, *h = list(map(int, open(0).read().split())) +left = h[0] +ans = 0 -for i in range(n - 1): -    if hs[i] >= hs[i + 1]: -        temp += 1 -        cnt = max(cnt, temp) +for i in range(1, n): +    if left >= h[i]: +        cnt += 1 -        temp = 0 -print(cnt) +        ans = max(ans, cnt) +        cnt = 0 +    left = h[i] +print((max(ans, cnt)))