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 nondecrease(n,profits):
    if type(n) is not int or type(profits) is not list:
        raise TypeError("Input does not satisfy type")
    
    if n < 1:
        raise ValueError("n not in range")
        
    if len(profits) != n:
        raise ValueError("profits must have length == n")
        
    increased = []
    
    for i in range(n):
        if i == 0:
            increased.append(1)
        else:
            if profits[i] >= profits[i-1]:
                increased.append(increased[-1]+1)
            else:
                increased.append(1)
    return max(increased)
        
n = int(raw_input())
profits = map(int, raw_input().split())
    
print nondecrease(n, profits)