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.
n = int(input()) # кол-во элементов
roster = input().split() # список элементов в str

# избавляемся от str
for i in range(n):
	roster[i] = int(roster[i])
roster.append(-1)
n += 1

max_length = 0
mini = 0
maxi = 0

i = 1
while i < n:
	if roster[i] >= roster[i-1]:
		mini = i-1
		for k in range(i,n):
			if roster[k] >= roster[k-1]:
				maxi = k
			else:
				i = k
				if maxi - mini > max_length:
					max_length = maxi - mini
				break
	i += 1
				
print(max_length + 1)
		
			


