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.
import sys

def readArgs():
	n = int(sys.stdin.readline())
	arr = map(int, sys.stdin.readline().split(' '))
	if len(arr) != n:
		return []
	return arr


def max_sub_seg(arr):
	if len(arr) < 2:
		return len(arr)
	gl = 1 #greatest length
	ll = 1 #current length
	li = 0 #lower index
	hi = 0 #higher index
	arr_len = len(arr)
	pre = arr[li]
	while hi < arr_len:
		if li == hi:
			ll = 1
			hi += 1
		else:
			nxt = arr[hi]
			cur = arr[hi-1]
			if nxt >= cur:
				ll += 1
				hi += 1
				pre = cur
				if ll > gl:
					gl = ll
			else:
				li = hi
	return gl


arr = readArgs()
gl = max_sub_seg(arr)
print gl
