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 = int(input())
income_lis = input()
income_lis = income_lis.split()
income_lis = [int(i) for i in income_lis]

max_non_dec = 1
end_flag = False
counter = 0
while counter < (num -1):
	temp_count = 1
	for j in range(counter, num -1):
		if income_lis[j+1] >= income_lis[j]:
			temp_count += 1
		else:
			counter = j+1
			break
		if j == num-2:
			end_flag = True
			break

	if temp_count > max_non_dec:
		max_non_dec = temp_count

	if end_flag:
		break


print(max_non_dec)
