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>).
# Read input
n = int(input())  # Number of days
a = list(map(int, input().split()))  # List of money earned each day

# Initialize variables
current_length = 1  # Current non-decreasing subsegment length
max_length = 1  # Maximum non-decreasing subsegment length

# Iterate over the sequence starting from the second element
for i in range(1, n):
    # Check if the current element is greater than or equal to the previous element
    if a[i] >= a[i - 1]:
        # Increment the current subsegment length
        current_length += 1
    else:
        # Reset the current subsegment length
        current_length = 1
    # Update the maximum subsegment length if needed
    max_length = max(max_length, current_length)

# Print the maximum non-decreasing subsegment length
print(max_length)
