n = int(eval(input()))

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

h.reverse()



ans = 0

val = 0



for i in range(1, n):

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

        val +=1

    else:

        val = 0

    ans = max(ans, val)

print(ans)
n = int(eval(input()))

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



tmp = H[0]

cnt = 0

ans = 0

for h in H[1:]:

    if tmp >= h:

        cnt += 1

    else:

        cnt = 0

    tmp = h

    ans = max(ans, cnt)

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

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

-h = list(map(int, input().split())) -h.reverse() +H = list(map(int, input().split())) +tmp = H[0] +cnt = 0 -val = 0 -for i in range(1, n): -    if h[i - 1] <= h[i]: -        val += 1 +for h in H[1:]: +    if tmp >= h: +        cnt += 1 -        val = 0 -    ans = max(ans, val) +        cnt = 0 +    tmp = h +    ans = max(ans, cnt)