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.
# Lang: pypy3.6-v7.1.0-win32\pypy3.exe
# Problem Name: KefaAndFirstSteps
# Problem Serial No: 580
# Problem Type: A
# Problem Url: https://codeforces.com/problemset/problem/580/A 
# Solution Generated at: 2019-04-22 23:57:51.528428 UTC

arr_len=int(input())
arr=list(map(int,input().split()))

all_len=[]
curr_len=1
curr_elem=arr[0]

for k in range(1,arr_len):
    if arr[k] >=curr_elem:
        curr_len+=1
        curr_elem=arr[k]
    else:
        all_len.append(curr_len)
        curr_len=1
        curr_elem=arr[k]
all_len.append(curr_len)
w=curr_len if len(all_len)==0 else max(all_len)
print(w)
