#ABC-139-C

N = int(eval(input()))

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



i = 0

ans = 0

max_ans = 0



while i + 1 <=  N-1:

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

        ans += 1

        max_ans = max(max_ans, ans)

    else:

        max_ans = max(max_ans, ans)

        ans = 0

    i += 1



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

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



before_H = H[0]

ans = 0

tmp = 0



for i in range(1, N):

    if before_H >= H[i]:

        tmp += 1

        before_H = H[i]

    else:

        ans = max(ans, tmp)

        tmp = 0

        before_H = H[i]



if tmp > 0:

    ans = max(ans, tmp)



print(ans)

# ABC-139-C
N = int(eval(input()))
H = list(map(int, input().split()))
i = 0
ans = 0
max_ans = 0
while i + 1 <= N - 1:
    if H[i] >= H[i + 1]:
        ans += 1
        max_ans = max(max_ans, ans)
    else:
        max_ans = max(max_ans, ans)
        ans = 0
    i += 1
print(max_ans)

N = int(eval(input()))
H = list(map(int, input().split()))
before_H = H[0]
ans = 0
tmp = 0
for i in range(1, N):
    if before_H >= H[i]:
        tmp += 1
        before_H = H[i]
    else:
        ans = max(ans, tmp)
        tmp = 0
        before_H = H[i]
if tmp > 0:
    ans = max(ans, tmp)
print(ans)

-# ABC-139-C -i = 0 +before_H = H[0] -max_ans = 0 -while i + 1 <= N - 1: -    if H[i] >= H[i + 1]: -        ans += 1 -        max_ans = max(max_ans, ans) +tmp = 0 +for i in range(1, N): +    if before_H >= H[i]: +        tmp += 1 +        before_H = H[i] -        max_ans = max(max_ans, ans) -        ans = 0 -    i += 1 -print(max_ans) +        ans = max(ans, tmp) +        tmp = 0 +        before_H = H[i] +if tmp > 0: +    ans = max(ans, tmp) +print(ans)