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>).
# To solve this problem, we can iterate through the sequence and keep track of the current non-decreasing
# subsegment's length and the maximum length encountered so far. Here's the algorithm:
#
# Read the value of n, the number of elements in the sequence. Read the sequence of n integers. Initialize two
# variables: maxLength = 1 (minimum length is always 1) and currentLength = 1 (initialize with the first element).
# Iterate from i = 1 to n-1:
#   a. If ai is greater than or equal to ai-1, increment currentLength by 1.
#   b. Otherwise, reset currentLength to 1.
#   c. Update maxLength if currentLength is greater than maxLength. Print the value of maxLength.

n = int(input())
sequence = list(map(int, input().split()))

maxLength = 1
currentLength = 1

for i in range(1, n):
    if sequence[i] >= sequence[i - 1]:
        currentLength += 1
    else:
        currentLength = 1
    maxLength = max(maxLength, currentLength)

print(maxLength)
