N = int(eval(input()))

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



inv = 0

max_inv = 0

for n in range(1, N):

    if H[n] <= H[n-1]:

        inv += 1

    else:

        inv = 0

    

    max_inv = max(max_inv, inv)



print(max_inv)



N = int(eval(input()))

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



inv = 0

max_inv = 0

for n in range(1, N):

    if H[n] <= H[n-1]:

        inv += 1

    else:

        max_inv = max(max_inv, inv)

        inv = 0



max_inv = max(max_inv, inv)

print(max_inv)



N = int(eval(input()))
H = list(map(int, input().split()))
inv = 0
max_inv = 0
for n in range(1, N):
    if H[n] <= H[n - 1]:
        inv += 1
    else:
        inv = 0
    max_inv = max(max_inv, inv)
print(max_inv)

N = int(eval(input()))
H = list(map(int, input().split()))
inv = 0
max_inv = 0
for n in range(1, N):
    if H[n] <= H[n - 1]:
        inv += 1
    else:
        max_inv = max(max_inv, inv)
        inv = 0
max_inv = max(max_inv, inv)
print(max_inv)

+        max_inv = max(max_inv, inv) -    max_inv = max(max_inv, inv) +max_inv = max(max_inv, inv)