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 *a*<sub class="lower-index">*i*</sub> money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a*<sub class="lower-index">*i*</sub>. 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!
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>).

The second line contains *n* integers *a*<sub class="lower-index">1</sub>,  *a*<sub class="lower-index">2</sub>,  ...,  *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
def solve():
	n = int(input())
	a = list(map(int, input().split()))

	if n == 1:
		return 1
	increasing = a[1] >= a[0]
	increasing_len = 2 if increasing else 0
	max_increasing = increasing_len
	for i in range(1,n-1):
		if a[i+1] >= a[i]:
			if increasing:
				increasing_len += 1
			else:
				increasing = True		
				increasing_len = 2
		else:
			increasing_len = 0
			increasing = False
		max_increasing = max(increasing_len, max_increasing)
	return max_increasing
print(solve())
