N = int(eval(input()))

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



stp = [0]*(N+1)

stp[0] = 0



for i in range(1,N):

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

        stp[i] = stp[i-1] +1

    else:

        stp[i] = 0

        

print((max(stp)))
N = int(eval(input()))

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

memo = [0]*N

for i in range(1,N):

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

        memo[i] = memo[i-1] + 1 

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

N = int(eval(input()))
h = list(map(int, input().split()))
memo = [0] * N
for i in range(1, N):
    if h[i] <= h[i - 1]:
        memo[i] = memo[i - 1] + 1
print((max(memo)))

-H = list(map(int, input().split())) -stp = [0] * (N + 1) -stp[0] = 0 +h = list(map(int, input().split())) +memo = [0] * N -    if H[i] <= H[i - 1]: -        stp[i] = stp[i - 1] + 1 -    else: -        stp[i] = 0 -print((max(stp))) +    if h[i] <= h[i - 1]: +        memo[i] = memo[i - 1] + 1 +print((max(memo)))