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 competitve_programming;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Random; 
public class cp {

	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int n=input.nextInt();
		int max=0;
		int prev=0;
		int current_count=0;
		for(int i=0;i<n;i++) {
			int a=input.nextInt();
			if(a>=prev) {
				prev=a;
				current_count++;
				if(current_count>max) {
					max=current_count;
				}
			}else {
				current_count=1;
				prev=a;
			}
		}
		System.out.println(max);
		
		
	}
	static int finder1(int[][] arr) {
		int k=0;
		int n=arr.length;
		int i=n-1;
		int j=n-1;
		int sum=0;
		while(i>=0||j>=0) {
			if(i==0&j!=0) {
				sum+=arr[i][j-1];
				j--;
			}else if(j==0&i!=0) {
				sum+=arr[i-1][j];
				i--;
			}else {
				sum+=Math.min(arr[i][j-1], arr[i-1][j]);
			}
		}
		return k;
	}
	static void problemone(int n1,int a, int b,int c,int d) {
		int n=(a+b)+(a-b);
		int s=n1*(a-b);
		int s2=n1*(a+b);
		if(s2<c-d||s>c+d) {
			System.out.println("NO");
		}else {
			System.out.println("YES");
		}
	}
	

}