N = int(eval(input()))

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



ans = 0

cnt = 0

for i in range(0, N-1):

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

        cnt += 1

        ans = max(cnt, ans)

    else:

        cnt = 0

print(ans)

n = int(eval(input()))

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



ans = 0

H_r = H[::-1]

cnt = 0



for i in range(n - 1):

    now = H_r[i]

    nex = H_r[i + 1]

    if now <= nex:

        cnt += 1

        ans = max(ans, cnt)

    else:

        cnt = 0

    nex = now

print(ans)

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

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

-N = int(eval(input())) +n = int(eval(input())) +H_r = H[::-1] -for i in range(0, N - 1): -    if H[i] >= H[i + 1]: +for i in range(n - 1): +    now = H_r[i] +    nex = H_r[i + 1] +    if now <= nex: -        ans = max(cnt, ans) +        ans = max(ans, cnt) +    nex = now