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>).
#https://codeforces.com/problemset/problem/580/A

number_of_integers = 6
list_of_integers = [2, 2, 1, 3, 4, 1]
list_of_increasing_segment = []
count = 1

for x in range(number_of_integers):
    try:
        if(list_of_integers[x] <= list_of_integers[x + 1]):
            count +=1
        else:
            list_of_increasing_segment.append(count)
            count = 1
    except:
        list_of_increasing_segment.append(count)

print(max(list_of_increasing_segment))