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.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
 
public class tr {
 
 
    private static final Scanner scanner = new Scanner(System.in);
 
    public static void main(String[] args) throws IOException {
    	int n=scanner.nextInt();
    	if(n!=1){
    	int a[]=new int[n];
    	for(int y=0;y<n;y++){
    		a[y]=scanner.nextInt();
    	}
    	ArrayList<Integer> f=new ArrayList<Integer>();
    	int r=1;
    	for(int i=1;i<n;i++){
    		if(a[i]>=a[i-1]){
    			r=r+1;
    		}
    		if(a[i]<a[i-1]){
    			f.add(r);
    			r=1;
    		}
    		f.add(r);
    	}
    	int g=f.get(0);
    	
    	for(int i=1;i<f.size();i++){
    		
    		if(f.get(i)>=g){
    			g=f.get(i);
    		}
    	}
    	System.out.println(g);
    	}
    	else if(n==1){
    		int k=scanner.nextInt();
    		System.out.println(1);
    	}
    }
}