n = int(eval(input()))

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



out, cnt = 0, 0

for i in range(n-1):

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

        cnt += 1

        out = max(out, cnt)

    else:

        cnt = 0



print(out)

n = int(eval(input()))

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



cnt = 0

result = 0

for i in range(n-1):

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

        cnt += 1

    else:

        result = max(cnt, result)

        cnt = 0



result = max(cnt, result)



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

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

-out, cnt = 0, 0 +cnt = 0 +result = 0 -    if h[i] >= h[i + 1]: +    if h[i] - h[i + 1] >= 0: -        out = max(out, cnt) +        result = max(cnt, result) -print(out) +result = max(cnt, result) +print(result)