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.*;
public class A580
{
     public static void main(String arrg[]){
        Scanner in=new Scanner(System.in);
        int cad=in.nextInt();
        ArrayList<Integer> list=new ArrayList<Integer>(cad);
        while(cad>0){
            int a=in.nextInt();
            list.add(a);
            cad--;
        }
        int cont=1;
        ArrayList<Integer> res=new ArrayList<Integer>();
        for(int i=0;i<=list.size()-1;i++){
            if(i!=list.size()-1){
                if(list.get(i)<=list.get(i+1)){
                    cont++;
                }
                else{
                    res.add(cont);
                    cont=1;
                }
            
            }
            else{
                res.add(cont);
            }
        
        }
        int res1=0;
        for(int i=0;i<=res.size()-1;i++){
            if(res.get(i)>res1){
                res1=res.get(i);
            }
        }
        System.out.println(res1);
    }
}
