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())
n1=input().split(" ")
l=[]
for i in n1:
    l.append(int(i))
tc=0
c=0
for k in range(0,len(l)-1,1):
    if k==len(l)-2:
        if l[k+1]>=l[k]:
            tc=tc+1
            if tc>c:
                c=tc
        else:
            if tc>c:
                c=tc
    elif l[k]<=l[k+1]:
        tc=tc+1
    else:
        if tc>c:
            c=tc
        tc=0
print(c+1)