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().strip())
num = list(map(int,input().split(' ')))
first_check = False
check_2 = False
count = 0
pre_num = num[0]
for i in range(1,n):
    if pre_num <= num[i]:
        count+=1
        pre_num = num[i]
    elif pre_num > num[i] and not first_check:
        count += 1
        check_2 = True
        max_count = count
        count = 0
        pre_num = num[i]
        first_check = True
    elif first_check and pre_num > num[i]:
        count += 1
        if count > max_count:
            max_count = count
        pre_num = num[i]
        count = 0
    if i == n-1 and check_2:
        count += 1
        if count > max_count:
            max_count = count
if check_2:
    print(max_count)
else:
    count += 1
    print(count)