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.
//package crash_course.chapter1;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class KefaBusiness {

	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));
		
		int n = Integer.parseInt(br.readLine());
		String profit = br.readLine();
		
		int previous = 0;
		int consecutive = 0;
		int greatestConsecutive = 0;
		
		for(String s: profit.split(" ")) {
			int current = Integer.parseInt(s);
			//System.out.println(s);
			if(current < previous) {
				//System.out.println("LESS");
				if(consecutive > greatestConsecutive) {
					greatestConsecutive = consecutive;
				}
				consecutive = 0;
				previous = 0;
			}
			if(current >= previous) {
				consecutive++;
				previous = current;
			}
		}
		
		if(consecutive > greatestConsecutive) {
			greatestConsecutive = consecutive;
		}
		
		pw.print(greatestConsecutive);
		br.close();
		pw.close();
	}
}
