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.
a=int(input())
b=list(map(int,input().split()))
finallist=[]
#for i in range():
if a==1:
	print(1)

else:

	t=0

	while t<a-1:
		currlist=[b[t]]
		i=t
		while i<a-1:
			#if i==a-1:
				#break
			if b[i+1]>=b[i]:
				currlist.append(b[i+1])
				#print(currlist)
				i+=1
				#print(i)
			#elif 	
			else:
				break
			#if len(currlist)==a	

		finallist.append(currlist)
		#print(finallist)
		t=i+1
	ans=len(finallist[0])
	for p in finallist:
		if len(p)>ans:
			ans=len(p)
	print(ans)						