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.*;
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 buf=new BufferedReader(new InputStreamReader(System.in));
		int n=Integer.parseInt(buf.readLine());
		String st[]=(buf.readLine()).split(" ");
		int arr[]=new int[n];
		for(int i=0;i<n;i++)
		arr[i]=Integer.parseInt(st[i]);
		int i=1,ct=1;
		ArrayList<Integer> adj=new ArrayList<Integer>();
		while(i<n)
		{
		    if(arr[i]-arr[i-1]>=0)
		    {
		        ct++;
		        i++;
		    }
		    else
		    {
		        adj.add(ct);
		        ct=1;
		        i++;
		    }
		}
		adj.add(ct);
		Collections.sort(adj);
		System.out.println(adj.get(adj.size()-1));
	}
}
