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

max_sequence = 1  # Maximum consecutive non-decreasing sequence length
current_sequence = 1  # Current consecutive non-decreasing sequence length

# Iterate through the candies starting from the second day
for i in range(1, n):
    if a[i] >= a[i-1]:
        # Current candy is greater than or equal to the previous one
        current_sequence += 1
    else:
        # Current candy is smaller than the previous one
        current_sequence = 1

    # Update the maximum sequence length if necessary
    max_sequence = max(max_sequence, current_sequence)

print(max_sequence)
