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 collections

class Reader():
	def __init__(self):
		self.data = collections.deque()
	def next_num(self):
		if len(self.data) == 0:
			self.data.extend(input().split())
		d = int(self.data.popleft())
		#print(f"Ret {d}")
		return d

r = Reader()
n = r.next_num()
p = r.next_num()
cc = 0
pc = 0
for i in range(n-1):
	c = r.next_num()
	if c>=p:
		cc += 1
		pc = max(pc, cc)
	else:
		cc = 0
	p = c

print(pc+1)
