Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1 ≤ *i* ≤ *n*) he makes *a*<sub class="lower-index">*i*</sub> money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a*<sub class="lower-index">*i*</sub>. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.

Help Kefa cope with this task!
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>).

The second line contains *n* integers *a*<sub class="lower-index">1</sub>,  *a*<sub class="lower-index">2</sub>,  ...,  *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
from os import path
import sys
if(path.exists('input.txt')):
    sys.stdin=open("input.txt","r")
    sys.stdout=open("output.txt","w")



# for _ in range(int(input())):
#     n = int(input())
#     l = [[j for j in input()] for i in range(n)]
#     print(l)
# n,k = map(int,input().split())
n = int(input())
l = list(map(int,input().split()))
i = 1
ca = 1
ans = 0
while(i<=n-1):
    if l[i]<l[i-1]:
        ca = 0
    else:
        ca+=1
    ans = max(ca,ans)
    i+=1
print(ans)




