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())
d = input().split()
data = []
i = 0
while i < n-1:
    data1 = [d[i]]
    for j in range(i,n-1):
        if int(d[j]) <= int(d[j+1]):
            data1 += [d[j+1]]
            i += 1
        else:
            i += 1
            break
    if len(data1) > 1:
        data += [data1]
for i in range(len(data)-1):
    for j in range(i+1,len(data)):
        if len(data[i])< len(data[j]):
            temp = data[i]
            data[i] = data[j]
            data[j] = temp
if len(data) == 0:
    print("1")
else:
    print(len(data[0]))
