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.
n=int(input())
a=[0 for i in range(100000)]
s=input()
i=0
t=0
while i<len(s):
    if i==len(s):
       break
    if s[i]==' ':
        i+=1
    else:
        x=''
        while (s[i]!=' ')and(i<len(s)):
          x=x+s[i]
          i+=1
          if i>=len(s):
             break
        a[t]=int(x)
        t+=1
i=0
l=1
length=1
while i<n-1:
    if a[i+1]>=a[i]:
        length+=1
        i+=1
    else:
        length=1
        i+=1
    if length>l:
       l=length
print(l)

    
    
        
