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.
if __name__ == '__main__':
	num = int(input())
	l = input().split()
	arr = [int(x) for x in l]
	maxSize = 0
	if num == 1:
		print(1)
	else:
		i = 0
		while i < len(arr) - 1:
		    curLen = 1
		    while arr[i + 1] >= arr[i] and (i + 1) < len(arr) - 1:
		        curLen += 1
		        i += 1
		    if curLen > maxSize:
		        maxSize = curLen
		    i += 1
		if arr[-1] >= arr[-2]:
		    curLen += 1
		if curLen > maxSize:
		    print(curLen)
		else:
		    print(maxSize)