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 get_period():
    days = int(input())
    numbers = [int(x) for x in input().split()]

    continuous_count = 1
    max_count = 1
    over = False

    for ind in range(0, days-1):
        if numbers[ind] <= numbers[ind+1]:
            continuous_count += 1
        else:
            over = True if ind == days - 2 else False
            if continuous_count > max_count:
                max_count = continuous_count
            continuous_count = 1

    if not over:
        return max_count if max_count > continuous_count else continuous_count

    return max_count


if __name__ == '__main__':
    print(get_period())
