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.
import sys
import io
import os

total = 0
failed = 0
def run(test,res):
    x = io.StringIO()
    with io.StringIO(test) as sys.stdin:
        with x as sys.stdout:
            work()
            z = x.getvalue().strip()
    sys.stdout = sys.__stdout__
    print("Passed?", z == res)
    print("Expected: ", res)
    print("Actual  : ", z)
    global total, failed
    total  += 1
    failed += 1 if (z != res) else 0

def work():
    n = int(input())
    f = list(map(int, input().split()))
    c = 0
    max = 0
    p = -1
    for e in f:
        # print(c, e, p, max)
        if e<p:
            c = 1
            p = e
            continue
        c += 1
        if c > max:
            max = c;
        p = e
    print(max)

def test():
    run("""6
2 2 1 3 4 1""", """3""")
    run("""3
2 2 9""", """3""")

if('LOCALTEST' in os.environ):
    test()
    print("\n Result: %s (%d total, %d failed)" % ("FAILED" if (failed>0) else "PASSED", total, failed))
else:
    work()
