n=int(eval(input()))

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

h=h[::-1]

dp=[0]*n

for i in range(1,n):

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

                dp[i] = 1+dp[i-1]

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

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



ans = 0

cnt = 0



for i in range(n-1):

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

        cnt += 1

    else:

        ans = max(ans, cnt)

        cnt = 0



ans = max(ans, cnt)

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

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

-h = h[::-1] -dp = [0] * n -for i in range(1, n): -    if h[i] >= h[i - 1]: -        dp[i] = 1 + dp[i - 1] -print((max(dp))) +ans = 0 +cnt = 0 +for i in range(n - 1): +    if h[i] >= h[i + 1]: +        cnt += 1 +    else: +        ans = max(ans, cnt) +        cnt = 0 +ans = max(ans, cnt) +print(ans)