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.util.*;
import java.io.*;
public class Main {
	public static void main (String[] args) {
		int n = readInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++) a[i] = readInt();
		int[] b = new int[n];
		b[0] = 1;
		int answer = 1;
		for (int i = 1; i < n; i++) {
			if (a[i] >= a[i-1]) b[i] = b[i-1] + 1;
			else b[i] = 1;
			answer = Math.max(answer,b[i]);
		}
		System.out.println(answer);
	}
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st;
	static String read () {
		while (st == null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(br.readLine()); 
			} catch (IOException e) {}
		}
		return st.nextToken();
	}
	static int readInt() {
		return Integer.parseInt(read());
	}
	static long readLong() {
		return Long.parseLong(read());
	}
}
//dp[l][r] = maximum score of the player who goes first on x[l..r]
//dp[l][r] = max(sum(l+1..r) - dp[l+1][r] + x[l],sum(l..r-1) - dp[l][r-1] + x[r])