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>).
# doing business on internet for n days
# i-th day (1 <= i <= n) he makes ai money 
# find max no. of decreasing subsegment in sequence ai
# A subsegment of numbers is the non-decreasing sequence if all the numbers that follows are non-decreasing 

n = int(input())
ai = list(map(int, input().split()))
c = 1
s=[]
# loop through each ai 
# if  ai[i] <= ai[i+1] c+=1 else c = 0 then c+=1 and restart counting
for i in range(0,n-1):
    if ai[i] <= ai[i+1]:
        c+=1
        s.append(c)
    else:
        c=1
print(max(s))