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>).
from functools import lru_cache
import sys
import threading


from collections import defaultdict
from sys import stdin,stdout,setrecursionlimit

setrecursionlimit(1 << 30)
threading.stack_size(1 << 27)
def memo(f):
    f.cache = {}
    def _f(*args, **kwargs):
        if args not in f.cache:
            f.cache[args] = f(*args, **kwargs)
        return f.cache[args]
    return _f

'''def main():
    n = int(input())

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




    # we will be using dp

    result = []
    max_ = float('-inf')

    def max_find(indx , prev , count , curr):
        
        if indx == len(lists):
            return 
        if prev == 0:
            
            pass
        if lists[indx] >= lists[prev]:
            curr.append((lists[indx] , lists[prev]))
            result.append(len(curr))
            max_find(indx +1 , indx , count + 1  , curr)
            
            
        else:
            
            max_find(indx , indx , 0 , [])
        


        return result


        


    count = 0

  




    
    res = max_find(0 , 0 , 0 , [])
    print(max(res))
'''
prev = 0
count = 0
max_ = float('-inf')
n = int(input())

lists = list(map(int , input().split()))
for i in range(1, len(lists)):
    if lists[i-1] <= lists[i]:
        count+=1
        max_ = max(max_ , count)
    else:
        count = 0
    
    

print(max_+1)
        


