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.
# -*- coding: utf-8 -*-
"""
Created on Wed Nov 21 15:30:17 2018

@author: Lenovo
"""
'''
TIME LIMIT EXCEEDED!

n=int(input())
a=[int(x) for x in input().split()]
s=[True]*(n-1)
c=[]
for i in range(1,n):
    if a[i]-a[i-1]<0:
        s[i-1]=False
p=0
c=[]
s.append(False)

for i in range(n-1):
    if s[p]==True:
        for i in range(1,n-p):
            if s[p+i]-s[p]!=0:
               # print(i)
                c.append(i)
                break


    p+=1
         
                
#print(s)
#print(c)
print(max(c)+1)
'''        


'''
input()
c = m =s =0
for x in input().split():
    x = int(x)
    c = c + 1 if x >= s else 1
    m = max(m,c)
    s = x
print(m)
'''


n=int(input())
l=list(int(x) for x in input().split())
k=m=1
for i in range(n-1):
    k=k+1 if l[i+1]>=l[i] else 1
    #print(k)
    m=max(m,k)
print(m)