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>).
lst = []

n = int(input())

numbers_str = input()

lst = numbers_str.split()

numbers = list(map(int, lst))

inc=[]
count=1
for i in range (n-1):
    if lst[i+1]<lst[i]:
        count=1
        inc.append(count)

    else:
        count+=1
        inc.append(count)

x = len(inc)

for i in range (x):
    for j in range (x-1):
        if inc[j]<inc[i]:
            inc[i],inc[j]=inc[j],inc[i]


print(inc[0])

        
