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())

lists = list(map(int , input().split()))


# we will be using dp

result = []
max_ = float('-inf')
def max_find(indx , prev , count , max_):
    
    if indx == len(lists):
        return 0
    if lists[indx] >= lists[prev]:
        max_ = max(max_ , count)
        max_find(indx +1 , indx , count + 1 , max_)
        
    else:
        result.append(count)
        max_find(indx + 1 , indx , 0 , float('-inf'))
    


    return result

    


count = 0
'''
max_ = float('-inf')
for i in range(len(lists)):
    for j in range(i+1 , len(lists)):
        if lists[i] <= lists[j]:
            count+=1
           
            max_ = max(max_ , count)
        else:
            result.append(count)
            count = 0
            continue

'''
res = max_find(0 , 0 , 0 , max_)
if not res:
    print(len(lists))
else:
    
    print(max(res) + 1)

