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(""))
input_string = input("")
a = [int(x) for x in input_string.split()]

counter = 0
ans = []

for i in range(n - 1):
    if a[i] <= a[i + 1]:
        counter += 1
    else:
        if counter > 0:  # Add this check to ensure counter is greater than 0 before appending
            ans.append(counter + 1)
            counter = 0

if counter > 0:  # Also add this check to handle the case when the last element is part of a non-decreasing subsequence
    ans.append(counter + 1)

ans = sorted(ans, reverse=True)

if len(ans) > 0:
    print(ans[0])
else:
    print(0)