from collections import deque

N = int(eval(input()))

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

ans = 0

n = 0

tmp = H.popleft()

while H:

  nxt = H.popleft()

  if tmp >= nxt:

    n += 1

    ans = max(ans, n)

  else:

    n = 0

  tmp = nxt

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

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

ans = 0

cnt = 0



pre = H[0]

for h in H[1:]:

    if h <= pre:

        cnt += 1

    else:

        ans = max(ans, cnt)

        cnt = 0

    pre = h

if cnt != 1:

    ans = max(ans, cnt)



print(ans)

from collections import deque

N = int(eval(input()))
H = deque(list(map(int, input().split())))
ans = 0
n = 0
tmp = H.popleft()
while H:
    nxt = H.popleft()
    if tmp >= nxt:
        n += 1
        ans = max(ans, n)
    else:
        n = 0
    tmp = nxt
print(ans)

N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
cnt = 0
pre = H[0]
for h in H[1:]:
    if h <= pre:
        cnt += 1
    else:
        ans = max(ans, cnt)
        cnt = 0
    pre = h
if cnt != 1:
    ans = max(ans, cnt)
print(ans)

-from collections import deque - -H = deque(list(map(int, input().split()))) +H = list(map(int, input().split())) -n = 0 -tmp = H.popleft() -while H: -    nxt = H.popleft() -    if tmp >= nxt: -        n += 1 -        ans = max(ans, n) +cnt = 0 +pre = H[0] +for h in H[1:]: +    if h <= pre: +        cnt += 1 -        n = 0 -    tmp = nxt +        ans = max(ans, cnt) +        cnt = 0 +    pre = h +if cnt != 1: +    ans = max(ans, cnt)