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.*;

public class Solution_1 {
	public static void main(String[] args) {
//		solution start :-)
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		int pos = 0, neg = 0, zer = 0;
		for(int i=0;i<n;i++){
		    a[i] = sc.nextInt();
		}
		int max = 0;
		int co = 1;
	    for(int i=0;i<(n-1);i++) {
	    	if(a[i+1]>=a[i]) {
	    		co++;
	    	}
	    	else {
	    		if(co>max) max = co;
	    		co = 1;
	    	}
	    }
		if(co>max) max =  co;
		System.out.println(max);
		
//		solution end \(^-^)/
//		                |
//		               / \
	}
	
}