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())
items = input().split()
items = [int(x) for x in items]
res = []
for k, i in enumerate(items):
    kj = k
    temp = 0
    while kj < len(items):
        if kj+1 < len(items):
            if items[kj] <= items[kj+1]:
                temp += 1
                kj += 1
            else:
                break    
        else:
            if items[kj-1] <= items[kj]:
                temp += 1
                break
            else:
                break
            
    res.append(temp)
    
print(max(res))