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 re
def gcd(x, y):
	while(y):
		x, y = y, x % y
	return x
def lcm(x,y):
	return (x*y)/gcd(x,y)
lucky_nums = [4,7,44,47,74,77]
def gen(nums):
	count =1 
	countarr = []
	for x in range(0,len(nums)-1):
		if(nums[x]<=nums[x+1]): 
			count = count+1
		else :
			countarr.append(count)
			count = 1
	countarr.append(count)
	return max(countarr)

def dothis():
	
	return map(lambda x: int(x),raw_input().split(" "))
def main():
	# nums = []
	nums1 = int(raw_input())
	nums = raw_input().split(" ")
	# word1 = raw_input()
	# word2 = raw_input()
	# puzzles = raw_input().split(" ")
	nums = map(lambda x: int(x),nums)
	#nums = [map(lambda x: int(x),raw_input().split(" ")) for t in range(0,nums1)]
	print gen(nums)

if __name__ == "__main__":
	# while True:
	# 	main()
	main()