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 ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence ai. 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!

Input

The first line contains integer n (1 ≤ n ≤ 105).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.

Examples

Input

6
2 2 1 3 4 1


Output

3

Input

3
2 2 9


Output

3

Note

In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one.

In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.
t=eval(input())
progress=list(map(int,input().split()))
#hype=list()
#sub=list()
maxi=0
count=1
for day in range(t-1):
    if progress[day]>progress[day+1]:
        if count>maxi:
            maxi=count
        count=1
    else:
        count+=1
if count>maxi:
    maxi=count
print(maxi)
'''
    if day==0:
        sub.append(progress[day])
    elif sub[-1]>progress[day]:
        hype.append(len(sub)-1)
        sub.clear()
        sub.append(progress[day])
        if count!=0:
            count=1
    else:
         count+=1
else:
    hype.append(count)
print(max(hype)) '''           
