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 ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence ai. 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!

Input

The first line contains integer n (1 ≤ n ≤ 105).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.

Examples

Input

6
2 2 1 3 4 1


Output

3

Input

3
2 2 9


Output

3

Note

In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one.

In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.
moneyList = []
 
# Check The inputs for Correctness [Based Of each input's Identifier]
def mCheckInputs(identifier,*args):
    if (identifier == "Is-INT-IN-RANGE"):
        if args[0].isdigit() and ( 1 <= int(args[0]) <= pow(10,5)):
            pass
        else:
            exit(1)
    else:
        # raise CustomException("ERROR!! Wrong Input(s)")
        exit(1)
 
# Handle inputs and their Checking and re-Formatting[Str ==> Int]
def mHandleInputs():
    global moneyList

    try:
        input1 = input()
        mCheckInputs('Is-INT-IN-RANGE',input1)
        n = int(input1)
        
        moneyList = list(map(int,input().split()))
        # moneyList = [r.randrange(pow(10,9)) for _ in range(int(input1))]
        # mCheckInputs('is-List-in-RAnge',moneyList,n)
        if ( len(moneyList) != n ): exit(1)
 
    except (ValueError) as e:
        exit(1)
    
#The Actual Logic [Brain Of Project]
def mDoWork(moneyList):
    if (moneyList.__len__() == 1) : return 1
 
    # moneyList = [r.randrange(pow(10,9)) for _ in range(pow(10,5))]
    lastIndex = 0
    maxima = 1
    mini = 1
    while True:
        maxima = maxima if maxima > mini else mini
        mini = 1
        if ((lastIndex == len(moneyList)-1) or (lastIndex == len(moneyList))): break
        for index in range(lastIndex+1,len(moneyList)):
            if ( (1 <= moneyList[index-1]  <= pow(10,9) ) or (1 <= moneyList[index]  <= pow(10,9)) or () ):
                if (moneyList[index-1] <= moneyList[index]):
                    mini += 1
                else:
                    lastIndex = index
                    break
            else:
                exit(1)
        lastIndex = index

    # temp = [ (mini1 if (moneyList[index-1] <= moneyList[index]) else 0) for _ in range(i+1,len(moneyList))]
    
    return maxima
 
# Re-Format the Result [ How and Where to show it ]
def mFormatResult(result):
    print(result)
 
def main():
  
    mHandleInputs()

    result = mDoWork(moneyList)

    mFormatResult(result)
 
if __name__ == "__main__":
    main()