import sys

def input():

    return sys.stdin.readline()[:-1]

n=int(eval(input()))

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

ans=[0]*n

tmp=1

for i in range(n-1):

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

        ans[i]=tmp

        tmp+=1

    else:

        tmp=1

print((max(ans)))
import bisect

import copy

import heapq

import math

import sys

from collections import *

from functools import lru_cache

from itertools import accumulate, combinations, permutations, product

def input():

    return sys.stdin.readline()[:-1]

def ruiseki(lst):

    return [0]+list(accumulate(lst))

sys.setrecursionlimit(500000)

mod=pow(10,9)+7

al=[chr(ord('a') + i) for i in range(26)]

direction=[[1,0],[0,1],[-1,0],[0,-1]]



n=int(eval(input()))

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

lst=[0]*n

for i in range(n-1):

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

        lst[i+1]=lst[i]+1

    else:

        lst[i+1]=0

# print(lst)

print((max(lst)))
import sys


def input():
    return sys.stdin.readline()[:-1]


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

import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product


def input():
    return sys.stdin.readline()[:-1]


def ruiseki(lst):
    return [0] + list(accumulate(lst))


sys.setrecursionlimit(500000)
mod = pow(10, 9) + 7
al = [chr(ord("a") + i) for i in range(26)]
direction = [[1, 0], [0, 1], [-1, 0], [0, -1]]
n = int(eval(input()))
h = list(map(int, input().split()))
lst = [0] * n
for i in range(n - 1):
    if h[i + 1] <= h[i]:
        lst[i + 1] = lst[i] + 1
    else:
        lst[i + 1] = 0
# print(lst)
print((max(lst)))

+import bisect +import copy +import heapq +import math +from collections import * +from functools import lru_cache +from itertools import accumulate, combinations, permutations, product +def ruiseki(lst): +    return [0] + list(accumulate(lst)) + + +sys.setrecursionlimit(500000) +mod = pow(10, 9) + 7 +al = [chr(ord("a") + i) for i in range(26)] +direction = [[1, 0], [0, 1], [-1, 0], [0, -1]] -ans = [0] * n -tmp = 1 +lst = [0] * n -    if h[i] >= h[i + 1]: -        ans[i] = tmp -        tmp += 1 +    if h[i + 1] <= h[i]: +        lst[i + 1] = lst[i] + 1 -        tmp = 1 -print((max(ans))) +        lst[i + 1] = 0 +# print(lst) +print((max(lst)))