n = int(eval(input()))

H = [int(x) for x in input().split()]

res = 0

right = 0

for left in range(n):

  while right+1 < n and H[right] >= H[right+1]:

    right += 1

  res = max(res, right - left)

  if right == left:

    right += 1

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

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

dp = [0] * (n + 1)

cc = 0

for i in range(1, n):

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

    cc += 1

    dp[i+1] = max(cc, dp[i])

  else:

    dp[i+1] = dp[i]

    cc = 0

print((dp[n]))

n = int(eval(input()))
H = [int(x) for x in input().split()]
res = 0
right = 0
for left in range(n):
    while right + 1 < n and H[right] >= H[right + 1]:
        right += 1
    res = max(res, right - left)
    if right == left:
        right += 1
print(res)

n = int(eval(input()))
h = [int(x) for x in input().split()]
dp = [0] * (n + 1)
cc = 0
for i in range(1, n):
    if h[i] <= h[i - 1]:
        cc += 1
        dp[i + 1] = max(cc, dp[i])
    else:
        dp[i + 1] = dp[i]
        cc = 0
print((dp[n]))

-H = [int(x) for x in input().split()] -res = 0 -right = 0 -for left in range(n): -    while right + 1 < n and H[right] >= H[right + 1]: -        right += 1 -    res = max(res, right - left) -    if right == left: -        right += 1 -print(res) +h = [int(x) for x in input().split()] +dp = [0] * (n + 1) +cc = 0 +for i in range(1, n): +    if h[i] <= h[i - 1]: +        cc += 1 +        dp[i + 1] = max(cc, dp[i]) +    else: +        dp[i + 1] = dp[i] +        cc = 0 +print((dp[n]))