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.io.*;
import java.util.*;


public class Solution {
    public static void main (String[] args) throws java.lang.Exception
	{
        FastReader fr = new FastReader();
        int n = fr.nextInt();
        int arr[] = new int[n];
        for(int i=0;i<n;i++){
            arr[i] = fr.nextInt();
        }
        int max = 1;
        int count = 1;
        for(int i=1;i<n;i++){
            if(arr[i]>=arr[i-1]){
                count++;
                max = Math.max(max, count);
            }
            else{
                count = 1;
            }
        }
        System.out.println(max);
	}
    

    static int gcd(int a, int b) {
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    } 
 
    static int lcm(int a, int b){
        int g = gcd(a,b);
        return a*(b/g);
    }
 
    static int exponentMod(int A,  int B, int C)  {    
        if (A == 0)  
            return 0;  
        if (B == 0)  
            return 1;    
        long y;  
        if (B % 2 == 0) 
        {  
            y = exponentMod(A, B / 2, C);  
            y = (y * y) % C;  
        }    
        else 
        {  
            y = A % C;  
            y = (y * exponentMod(A, B - 1,  C) % C) % C;  
        }  
        return (int)((y + C) % C);  
    }
 
    static class FastReader{ 
        BufferedReader br; 
        StringTokenizer st; 
 
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
 
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
 
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
 
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
 
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
 
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    }    
}