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.*;
public class Main {	
		public static void main(String[] args) throws Exception{
			
		BufferedReader b = new BufferedReader(new InputStreamReader(System.in));
		
		int n1 = Integer.parseInt(b.readLine());
		String[] line = b.readLine().split(" ");
		int[] n2 = new int[n1];
		for (int i = 0; i < n1; i++){
			n2[i] = Integer.parseInt(line[i]);
		}
		
		if (n1 == 1)
			System.out.println(1);
		else
		{
			int n3 = 0;
			int n4 = 1;
			for (int i = 0; i < n1 - 1; i++){
				if (n2[i+1] >= n2 [i])
					n4++;
				else
					n4 = 1;
				if (n4 > n3)
					n3 = n4;
			}	
		
			System.out.println(n3);
			b.close();
		}
	}
}
 		 	 	    			 	  	 	  	 	 	 		