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.ArrayList;
import java.util.Scanner;
import java.util.Stack;
import java.util.stream.IntStream;

public class Main {
    public static boolean IsSorted(int []arr,int index) {
        for (int i = 1; i <= index; i++) {
            if(arr[i]<arr[i-1]){
                return false;
            }
        }
        return true;
    }
    public static Integer[] sorter(int []x) {
        ArrayList<Integer> sorted=new ArrayList<>();
        sorted.add(0, x[0]);
    for (int i = 1; i < x.length; i++) {
        boolean added=false;
        for (int j = 0; j < sorted.size(); j++) {
            if(x[i]>=sorted.get(j)){
                sorted.add(j, x[i]);
                added=true;
                break;
            }
        }
        if(!added)sorted.add(x[i]);
    }        
        
        return sorted.toArray(new Integer [0]);
    }
    public static int methos(int [] x) {
    int max=1;
    int temp=1;
        for (int i = 1; i < x.length; i++) {
            if(x[i]>=x[i-1]){temp++;
            }
            else {
                
                temp=1;
                
            }
            if(temp>=max){max=temp;}
        }
    return max;
        
    }

    public static void main(String[] args) {
        Scanner obj = new Scanner(System.in);
        int size=(obj.nextInt()) ;
        int []arr=new int [size];
        for (int i = 0; i < arr.length; i++) {
            arr[i]=obj.nextInt() ;
        }
        System.out.println(methos(arr));  
    }
}