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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Vector;

public class A {
	public static final boolean DEBUG = false;
	String filename = "";
	Scanner sc;
	PrintWriter pw;

	public void dbg(Object o) {
		System.out.println(o);
	}
	
	public void pln(Object o) {
		pw.println(o);
	}
	
	public void run() throws FileNotFoundException {
		if (filename.isEmpty()) {
			sc = new Scanner(System.in);
			pw = new PrintWriter(System.out);
		}
		else {
			sc = new Scanner(new File(filename + ".in"));
//			pw = new PrintWriter(new File(filename + ".out"));
			pw = new PrintWriter(System.out);
		}
		
		int n = sc.nextInt();
		int prev = Integer.MAX_VALUE;
		int maxlen = 0, crtlen = 0;
		for (int i=0; i<n; i++) {
			int a = sc.nextInt();
			if (a >= prev) {
				crtlen++;
			}
			else {
				crtlen = 1;
			}
			prev = a;
			if (crtlen > maxlen) maxlen = crtlen;
		}
		pln(maxlen);
	}

	public static void main(String[] args) {
		A t = new A();
		try {
			t.run();
			t.pw.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}
}