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(""))        #Enter Number of Days
y1=input("")            #Enter the Sequence with Spaces
y=y1.split()
s=0
p=[]
if n>2:
    for i in range(0,n-1):
        g=int(y[i+1])
        h=int(y[i])
        if i!=n-2:
            if g>=h:
                s=s+1
                p.append(s)
            else:
                s=s+1
                p.append(s)
                s=0
        else:
            if int(y[n-1])>=int(y[n-2]):
                s=s+2
                p.append(s)
            else:
                s=s+1
                p.append(s)
    print(max(p))
else:
    if n==2:
        if y[1]>=y[0]:
            print(2)
        else:
            print(1)
    if n==1:
        print(1)
