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.
count = 0        # Counts the number of times the condition is met.
x = int(input())
y = 0
first = True
numbers = [int(num) for num in input().split()]

for index in range(1, x):
    before = numbers[index - 1]
    now = numbers[index]
    if now >= before and first:
        first = False
        count += 2
        if count >= y:
            y = count
    elif now >= before and not first:
        count += 1
        if count >= y:
            y = count
    else:
        first = True
        count = 0

if x == 1 or (y == 0 and x >= 100):
    y = 1

print(y)