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.
def isSorted(l):
    for i in range(0, len(l)-1):
    	if (l[i]>l[i+1]):
    		return False
    return True

def findMax(l, N):
	m = 0
	s = 0
	e = 1
	while(e <= N):

		#print l[s:e]
		#print lastElement
		while(e < N and l[e-1] <= l[e]):
			#print l
			#print l[s:e]
			#print e
			e = e + 1
		

		#print l[s:e]
		
		e = e+1
		if (m < e - s - 1):
			m = e - s - 1
		s = e-1


	return m
def routine(a, N):
	if (isSorted(a)):
		print N
		return
	print findMax(a,N)




N = raw_input()
N = int(N)
a = raw_input()
a = a.split(' ')
a = map(int,a)

routine(a, N)