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.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

import javax.tools.ToolProvider;



public class knapsack {
	static int a[];	
	static int n;
	static int memo[][];
	
	

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		 n=sc.nextInt();
	    a=new int[n];
	    int max=0;
	    for(int i=0;i<n;i++) {
	    	a[i]=sc.nextInt();
	    	max=Math.max(max, a[i]);
	    }
//	    memo=new int[2][max+1];
//	    
//	    System.out.println(dp(1));
	    int maxx=1;
	    int acc=1;
	    for(int i=1;i<n;i++) {
	    	if(a[i]>=a[i-1])acc++;
	    	else {
	    		maxx=Math.max(maxx, acc);
	    		acc=1;
	    	}
	    }
	    System.out.println(Math.max(maxx, acc));
	}
	static int dp(int idx) {
		if(idx>=n)return 0;
		if(a[idx]<a[idx-1])return 0;
		return  Math.max(1+dp(idx+1), dp(idx+1));
	}
	static int bottomup(int max) {
		int k=0;
		for(int i=1;i<=n;i++) {
			
			k=i%2;
			for(int j=0;j<=max;j++) {
				if(a[n-i]<j)memo[k][j]=0;
				else memo[k][j]=Math.max(1+memo[k^1][a[n-i]], memo[k^1][j]);
			}
			print(memo);
			System.out.println();
		}

		return(memo[k][0]);
		
	}
	public static void print(int [][]a) {
		System.out.println(Arrays.toString(a[0]));
		System.out.println(Arrays.toString(a[1]));
	}

	
	
	static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        Scanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        long nextLong() throws IOException {
            return Long.parseLong(next());
        }


	}

}

