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.
num_days = int(input())
seq = [int(a) for a in input().strip().split()]

# Find the length of the maximum non-decreasing subsegment
max_length = -float("inf")
last_num = -float("inf")
restarted = False


current_length = 0
for num in range(num_days):
    if seq[num] >= last_num:
        current_length += 1
    else:
        # this marks the end of the subsegment
        # check if it's a new max_length
        if current_length > max_length:
            max_length = current_length
        # restart current length
        current_length = 1

    # set the last num
    last_num = seq[num]
# if it ends in the middle of a nondecreasing subsegment
# check if current length is greater than max_length

if current_length > max_length:
    max_length = current_length

print(max_length)
