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.
# function to find the length of longest 
# increasing contiguous subarray 
def lenOfLongIncSubArr(arr, n) : 
 
	# 'max' to store the length of longest 
	# increasing subarray 
	# 'len' to store the lengths of longest 
	# increasing subarray at diiferent 
	# instants of time 
	m = 1
	l = 1
	
	# traverse the array from the 2nd element 
	for i in range(1, n) : 
 
		# if current element if greater than previous 
		# element, then this element helps in building 
		# up the previous increasing subarray encountered 
		# so far 
		if (arr[i] >= arr[i-1]) : 
			l =l + 1
		else : 
 
			# check if 'max' length is less than the length 
			# of the current increasing subarray. If true, 
			# then update 'max' 
			if (m < l) : 
				m = l 
 
			# reset 'len' to 1 as from this element 
			# again the length of the new increasing 
			# subarray is being calculated	 
			l = 1
		
		
	# comparing the length of the last 
	# increasing subarray with 'max' 
	if (m < l) : 
		m = l 
	
	# required maximum length 
	return m 
 
# Driver program to test above 
n=int(input(""))
arr=list(map(int,input("").split()))
print(lenOfLongIncSubArr(arr, n)) 