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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Main {
    private static boolean eof = false ;
    public static void main(String[] args) {
        Reader in = new Reader(new BufferedReader(new InputStreamReader(System.in))) ;
        int n = in.nextInt() ;
        int longest = 1 ;
        int large = 0;
        int a = in.nextInt() ;
        for(int i = 0 ; i<n-1 ; i++)  {
            int b = in.nextInt() ;
            if(b>=a) {
                longest++ ;
                //System.out.println("longest "+longest);
            }
            else {
                large = Math.max(large, longest) ;
                longest = 1 ;
            }
            a = b ;
            //System.out.println("large is "+large+" longest is "+longest);
            if(large<longest) {
                large = longest ;
            }
        }
        if(large<longest) {
            large = longest ;
        }
        System.out.println(large);
    }

    static class Reader {
        private static BufferedReader b ;
        public static String line ;
        public Reader() {
        }

        public Reader(BufferedReader b) {
            this.b = b ;
        }
        private static StringTokenizer st = null;
        public static String next()  {

            if(st==null || !st.hasMoreElements()) {
                try {
                    line = b.readLine() ;
                    if(line==null) {
                        eof = true ;
                        return null ;
                    }
                    else {
                        st=new StringTokenizer(line);
                    }
                } catch (IOException ex) {

                }
            }
            return st.nextToken() ;
        }
        public static String nextLine()  {
            try {
                return b.readLine() ;
            } catch (IOException ex) {

            }
            return line ;
        }
        public static int nextInt()  {
            return Integer.parseInt(next());
        }
        public static long nextLong()  {
            return Long.parseLong(next());
        }
        public static float nextFloat()  {
            return Float.parseFloat(next());
        }
        public void close() throws IOException {
            b.close() ;
        }

    }
}
