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>).
n0=int(input())
n=list(map(int, input().split()))
s=""
#n=[2,9,9,3,4,1]
for i in range(len(n)+1):
    if ( i+1 != len(n) ):
            #if (n[i]-n[i+1])>=1 or (n[i]-n[i+1])<1:
            if ((n[i]-n[i+1]) !=0 ):
                s=i+1
                #print(i+1)
                break
                     #print(n[i+1])
        #print(n[i] , " +1>  " , n[i+1] )
    else:
        break



    
print(s+1)