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.
def retrieve_data():
    qty_of_steps = int(raw_input())
    steps_list = [int(k) for k in raw_input().split()]
    return [qty_of_steps, steps_list]

def steps(data):
    n = data [0]
    steps_list = data[1]
    count = 1
    maximum = 1
    if len(steps_list) == 1:
        return 1
    for i in xrange(len(steps_list)-1):
        if steps_list[i+1] >= steps_list[i]:
            count += 1
            if count >= maximum:
                maximum = count
        else:
            count = 1
    return maximum
                   

def main():
    data = retrieve_data()
    #print data
    #data = [6, [2, 2, 1, 3, 4, 1]]
    #data = [[6], [10,12,10,7,5,22]]
    #data = [[3], [2,2,9]]
    #data = [1, [2]]
    print steps(data)

if __name__ == '__main__':
    main()