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>).
import sys
def read_input():
    return sys.stdin.readline().rstrip()
def read_ints():
    return map(int, read_input().split())
num1 = int(read_input())
num2 = 1
list1 = list(read_ints())
list2 = []
if num1 % 2 == 0:
    num3 = num1 // 2
else:
    num3 = (num1 // 2) + 1
for x in range(num1):
    if x == num1 - 1:
        list2.append(num2)
        break
    elif list1[x] <= list1[x+1]:
        num2 += 1
    else:
        list2.append(num2)
        if num2 >= num3 - ((x + 1) - num2):
            break
        num2 = 1
print(max(list2))