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 codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		//BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
		String temp=br.readLine();
		int size1=Integer.parseInt(temp);
		String[] s1=br.readLine().split(" ");
		Long[] data=new Long[size1];
		int counter=1,max1=0;
		for(int i=0;i<size1-1;i++){
		    if(Long.parseLong(s1[i])<=Long.parseLong(s1[i+1]))
		    {
		        //System.out.println(s1[i]);
		        counter++;
		    }
		    else{
		        if(max1<counter){
		            max1=counter;
		        }
		        counter=1;
		    }
		    
		}
		if(max1<counter){
		    max1=counter;
		}
		System.out.println(max1);
		//bw.write(max1);
		//bw.flush();
	}
}
