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>).
def solution(n, a):
    if a == sorted(a):
        return len(a)

    curr_count = 1
    lengths_of_subsegments = []
    i = 0  # Initialize 'i' outside of the while loop

    while i < n - 1:
        if a[i] <= a[i + 1]:
            curr_count += 1
            i += 1
        else:
            lengths_of_subsegments.append(curr_count)
            curr_count = 1  # Reset 'curr_count'
            i += 1
    lengths_of_subsegments.append(curr_count)  # Add the last subsegment

    return max(lengths_of_subsegments)

n = int(input())
a = list(map(int, input().split()))
print(solution(n, a))