n=int(eval(input()))

h=[int(i) for i in input().split()]

c=0

d=c

for i in range(n-1):

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

        c+=1

    else:

        d=max([c,d])

        c=0



print((max([c,d])))
n = int(eval(input()))

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

tmp = 0

result = 0



for i in range(n-1):

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

        tmp += 1

    else:

        if tmp > result:

            result = tmp

        tmp = 0

if tmp > result:

    result = tmp

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

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

-h = [int(i) for i in input().split()] -c = 0 -d = c +L = list(map(int, input().split())) +tmp = 0 +result = 0 -    if h[i] >= h[i + 1]: -        c += 1 +    if L[i] >= L[i + 1]: +        tmp += 1 -        d = max([c, d]) -        c = 0 -print((max([c, d]))) +        if tmp > result: +            result = tmp +        tmp = 0 +if tmp > result: +    result = tmp +print(result)