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

nums = list(map(int,input().split()))[:n]
# print(nums)
left = nums[0]
# right = nums[1]
maxLength = 1
temp = 1
for i in range(1,len(nums)):
    right = nums[i]
    if right >= left:
        temp += 1
    else:
        if maxLength < temp:
            maxLength = temp
            temp = 1
    left = nums[i]
        # right = nums[i+1]
# maxLength = temp
print(maxLength if maxLength > temp else temp)