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.
#!/usr/bin/env python3
import unittest


# 20150930
# 10:35AM-


def solve(n, a):
    s = 1
    p = 0
    for i in range(1,len(a)):
        if a[i] >= a[i-1]:
            s = max(s, i-p+1)
        else:
            p = i
    return s

def main():
    n = int(input())
    a = list(map(int,input().split()))
    print (solve(n, a))


if __name__ == '__main__':
    main()

class Tests(unittest.TestCase):
    def test_1(self):
        n = int("6")
        a = list(map(int,"2 2 1 3 4 1".split()))
        self.assertEqual(solve(n, a), 3)
    def test_2(self):
        n = int("3")
        a = list(map(int,"2 2 9".split()))
        self.assertEqual(solve(n, a), 3)
    def test_3(self):
        n = int("3")
        a = list(map(int,"3 2 1".split()))
        self.assertEqual(solve(n, a), 1)
    def test_4(self):
        n = int("3")
        a = list(map(int,"1 2 3".split()))
        self.assertEqual(solve(n, a), 3)
    def test_5(self):
        n = int("5")
        a = list(map(int,"2 2 2 2 2".split()))
        self.assertEqual(solve(n, a), 5)
    def test_9(self):
        n = int("1")
        a = list(map(int,"1".split()))
        self.assertEqual(solve(n, a), 1)
