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 collections import Counter
#import math
count_time=0
if count_time:
    import time
    start_time = time.time()
'''
t=int(input())
ans=list()

for _ in range(t):
    l,t=map(int,input().split())
    
print(*ans,sep='\n')'''
n=int(input())
a=list(map(int,input().split()))
maxo=0
t=0
x=a[0]
for i in a:
    if i>=x:t+=1
    else:
        if t>maxo:maxo=t
        t=0
    x=i
if t>maxo:maxo=t
print(maxo)
if count_time:
    end_time = time.time()
    print('----------------\nRunning time: {} s'
          .format(end_time - start_time))

