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.
def main():
    a=int(input())
    list1=list(input().split())
    m=1
    list_num=[]
    list_check=[]
    check=1
    for i in range(a):
        list_num+=[int(list1[i])]
    num=list_num[0]
    if len(list_num)==1:
        list_check += [1]
    else:
        for k in list_num[1:]:
            m+=1
            if k >= num:
                check+=1
                num=k
            else:
                num=k
                list_check+=[check]
                check=1
            if m == len(list1):
                list_check += [check]
    list_check.sort()
    output=list_check[::-1]
    print(output[0])

if __name__=='__main__':
    main()