N = int(eval(input()))

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



ans   = 0

count = 0





for j in range(N):

    if N == 1:

       break

 

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

        count += 1

    else:

        ans    = max(ans, count)

        count  = 0



    if j == N-2:

        if count > ans:

            ans   = count

        break



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

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



ans   = 0

count = 0





for j in range(N):

    if N == 1:

       break

 

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

        count += 1

    elif count > ans:

        ans   = count

        count = 0

    else:

        count = 0

      

    if j == N-2:

        if count > ans:

            ans   = count

        break



print(ans)

N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
count = 0
for j in range(N):
    if N == 1:
        break
    if H[j] >= H[j + 1]:
        count += 1
    else:
        ans = max(ans, count)
        count = 0
    if j == N - 2:
        if count > ans:
            ans = count
        break
print(ans)

N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
count = 0
for j in range(N):
    if N == 1:
        break
    if H[j] >= H[j + 1]:
        count += 1
    elif count > ans:
        ans = count
        count = 0
    else:
        count = 0
    if j == N - 2:
        if count > ans:
            ans = count
        break
print(ans)

+    elif count > ans: +        ans = count +        count = 0 -        ans = max(ans, count)