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 java.io.PrintStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.function.Function;

import static java.util.stream.Collectors.*;

public class Solver {
    private final Scanner sc;
    private final PrintStream out;

    Solver(Scanner sc, PrintStream out) {
        this.sc = sc;
        this.out = out;
    }

    public void solve() {
        int longestSequence = 0;
        int currentSequenceLen = 0;
        int prevNumber = -1;
        int totalNumbers = sc.nextInt();

        for (int i = 0; i < totalNumbers; i++) {
            int no = sc.nextInt();
            if (no >= prevNumber) {
                currentSequenceLen++;
                if (currentSequenceLen > longestSequence) {
                    longestSequence = currentSequenceLen;
                }
            } else {
                currentSequenceLen = 1;
            }

            prevNumber = no;
        }

        out.println(longestSequence);
    }

    public static void main(String[] args) {
        new Solver(new Scanner(System.in), System.out).solve();
    }
}
