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.
from __future__ import print_function
import sys
from sys import stdin
sys.setrecursionlimit(1000000)
n = int(stdin.readline())
A = map(int, stdin.readline().split(' '))

B = [1] * len(A)
if len(A) == 1:
    print(1)
    exit(0)

for i in xrange(len(B) - 2, -1, -1):
    if A[i] <= A[i+1]:
        B[i] += B[i+1]
print(max(B))



# def longest_subs(A):
#     head, tail = A[0], A[1:]
#     if len(tail) == 0:
#         return [1]
#     tails = longest_subs(tail)
#     return [1 + tails[0] if head <= tail[0] else 1] + tails

# print(max(longest_subs(A)))