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())
columns = [int(x) for x in input().split()]
non_decreasing_sequences = []
storage = 0

for i in range(n):
    try:
        if columns[i] > columns[i + 1]:
            non_decreasing_sequences.append(columns[0:i + 1])
            columns = columns[i + 1::]
    except IndexError:
        break

ascending_lengths = [len(x) for x in non_decreasing_sequences]
if ascending_lengths == []:
    print(n)
else:
    print(max(ascending_lengths))
