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.
# @Date    : 2016-06-22 13:32:56
# @Author  : Samandar Ravshanov (ravshanoff@protonmail.com)
# @Problem : http://codeforces.com/problemset/problem/580/A


import unittest

from random import randint
from sys import maxsize

class StressTest(unittest.TestCase):
	known_values = (
		# A,                        expected
		( [2, 2, 1, 3, 4, 1],   	  3),
		( [2, 2, 9], 				  3),
		( [8],                        1),
	)

	def test_known_cases(self):
		for A, expected in self.known_values:
			self.assertEqual(expected, NaiveSolution().kefa(A))

	def test_all_cases(self):	
		while True:
			break


class NaiveSolution:
	def kefa(self, A):
		count = 1

		max_val = -maxsize

		for i in range(len(A)):
			if (i+1) < len(A) and A[i] <= A[i+1]:
				count += 1
			else:
				count = 1

			max_val = max(max_val, count)

		return max_val



class BestSolution:
	pass


if __name__ == '__main__':
	#unittest.main()

	n = int(input())
	A = [int(x) for x in input().strip().split()]
	ans = NaiveSolution().kefa(A)
	print(ans)


