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())
l = list(map(int,input().split()))
ll = []
llll = []
if len(l) == 1:
	print(1)

else:
	for i in range(n-1):
		if l[i] <= l[i+1]:
			ll.append(1)
		else:
			ll.append(0)
	import itertools
	lll = [len(list(v)) for k,v in itertools.groupby(ll)]
	if len(lll) == 1:
		if ll[0] == 1:
			print(n)
		else:
			print(1)
	else:
		if len(lll)%2 == 0:
			if ll[0] == 1:
				for i in range(int(len(lll)/2)):
					llll.append(lll[2*i])
			else:
				for i in range(int(len(lll)/2)):
					llll.append(lll[2*i+1])
		else:
			if ll[0] == 1:
				for i in range(int(len(lll)//2+1)):
					llll.append(lll[2*i])
			else:
				for i in range(int(len(lll)//2)):
					llll.append(lll[2*i+1])
		print(max(llll)+1)
