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.
#467A
'''n=int(input())
q=0
for i in range(n):
    w=[x for x in input().split( )]
    a=int(w[0])
    b=int(w[1])
    if b-a>1:
        q=q+1
print(q)
'''
#110A
'''a=str(input())
qq=' '.join(a)
qq.split()
z=qq.count('4')+qq.count('7')
if z==4 or z==7:
    print("YES")
else:
    print("NO")
'''
#41A
'''a=str(input())
b=str(input())
aa=' '.join(a)
aaa=aa.split()
aaa.reverse()
bb=' '.join(b)
bbb=bb.split()
if(aaa==bbb):
    print("YES")
else:
    print("NO")
'''
#617A
'''x=int(input())
a=-((-x)//5)
print(a)'''
#580A
if(1==1):
    if(1==1):
        n=int(input())
        a=[x for x in input().split()]

        num=[]
        for i in range(n):
            num.append(int(a[i]))
        step=0
        long=0
        #print(num)
        while step<n:
            j=step
            if j==n-1:
                if long==0:
                    long=1
                break
            
            tem=0
            yan=0
            while step<n:
                if num[step]>=num[j]:
                    num[j]=num[step]
                    tem+=1
                    step+=1
                else:
                    yan=1
                    #step-=1
                    break
            if tem>long:
                long=tem
            if j<n-1 and step==n:
                break;
            

        print(long)
            
