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())
A = list(map(int, input().split()))

def crossLength(l, m, r):
    count = 0
    if A[m] > A[m + 1]:
        return count
    else:
        count += 1

    for i in range(m - l):
        if A[m - i] >= A[m - i - 1]:
            count += 1
        else:
            break

    for i in range(r - m):
        if A[m + i + 1] >= A[m + i]:
            count += 1
        else:
            break
    return count

def findSubsegmentLength(l, r):
    if l == r:
        return 1
    m = (r + l) // 2
    left_length = findSubsegmentLength(l, m)
    right_length = findSubsegmentLength(m + 1, r)
    mid_legth = crossLength(l, m, r)
    return max(left_length, right_length, mid_legth)

print(findSubsegmentLength(0, len(A) - 1))
