n = int(eval(input()))

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

h.reverse()

ans = 0

value = 0



for i in range(1, n):

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

        value += 1

    else:

        value = 0

    ans = max(ans, value)



print(ans)

import sys



sys.setrecursionlimit(10 ** 7)

f_inf = float('inf')

mod = 10 ** 9 + 7





def resolve():

    n = int(eval(input()))

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



    res = 0

    cnt = 0

    for i in range(1, n):

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

            cnt += 1

        else:

            res = max(res, cnt)

            cnt = 0

    res = max(res, cnt)

    print(res)





if __name__ == '__main__':

    resolve()

n = int(eval(input()))
h = list(map(int, input().split()))
h.reverse()
ans = 0
value = 0
for i in range(1, n):
    if h[i - 1] <= h[i]:
        value += 1
    else:
        value = 0
    ans = max(ans, value)
print(ans)

import sys

sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7


def resolve():
    n = int(eval(input()))
    H = list(map(int, input().split()))
    res = 0
    cnt = 0
    for i in range(1, n):
        if H[i - 1] >= H[i]:
            cnt += 1
        else:
            res = max(res, cnt)
            cnt = 0
    res = max(res, cnt)
    print(res)


if __name__ == "__main__":
    resolve()

-n = int(eval(input())) -h = list(map(int, input().split())) -h.reverse() -ans = 0 -value = 0 -for i in range(1, n): -    if h[i - 1] <= h[i]: -        value += 1 -    else: -        value = 0 -    ans = max(ans, value) -print(ans) +import sys + +sys.setrecursionlimit(10**7) +f_inf = float("inf") +mod = 10**9 + 7 + + +def resolve(): +    n = int(eval(input())) +    H = list(map(int, input().split())) +    res = 0 +    cnt = 0 +    for i in range(1, n): +        if H[i - 1] >= H[i]: +            cnt += 1 +        else: +            res = max(res, cnt) +            cnt = 0 +    res = max(res, cnt) +    print(res) + + +if __name__ == "__main__": +    resolve()