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.
z=int(raw_input())
y=[]
y=list(raw_input().split())
k=1
ans=[]
if sorted(y) == y:
	print len(y)
else:
	for x, z in zip(y, y[1:]):
		x=int(x)
		z=int(z)
		if x<=z:
			k+=1
			ans.append(k)
		if x>z:
			
			k=1
	#print ans
	#print max(ans)
	#print k
	if not ans:
		print k
	elif max(ans)>=k:
		#print "k"
		print max(ans)
	else:
		#print "l"
		print k
	

'''for i in range(len(y)-1):
    		if y[i]<=y[i+1]:
			print y[i],y[i+1]
           		k+=1
	print k'''

