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>).
def II():
    return(int(input()))
def LMI():
    return(list(map(int,input().split())))
def I():
    return(input())
def P1(x):
    print(x)
def P2(x):
    print(*x)
def MI():
    return(map(int,input().split()))
import io,os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def t():
    n=II()
    L=LMI()
    dp=[1]*n
    for i in range(1,n):
        if L[i]>L[i-1]:
            dp[i]=dp[i-1]+1
    print(max(dp))        
            
                
    
       
        
if __name__=="__main__":
    
    t()