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())
arr=list(map(int,input().split()))
p1=0
ans=1
c=1
while(p1<n-1):
    if(arr[p1]<=arr[p1+1]):
        c+=1
    else:
        ans=max(ans,c)
        c=1
    p1+=1
ans=max(ans,c)
print(ans)


'''
def check(ar,n,i,j):
    for k in range(i,j):
        if(ar[k]>ar[k+1]):
            return False
    return True
n=int(input())
arr=list(map(int,input().rstrip().split()))
ans=0
for i in range(n):
    c=0
    for j in range(i,n):
        if(check(arr,n,i,j)==True):
            c+=1
        else:
            break
    ans=max(ans,c)
print(ans)
            
        



ans=0
for j in range(n):
    count=1
    i=j
    b=ans
    if(b>n-j):
        break
    while(i<n-1):
        if(arr[i]<=arr[i+1]):
            count+=1
            i+=1
        else:
            break
    ans=max(ans,count)
print(ans)

'''
