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.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class Acf {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
        long n=Long.parseLong(bf.readLine());
        StringTokenizer tk=new StringTokenizer(bf.readLine());
        long []arr=new long[(int)n];
        arr[0]=Long.parseLong(tk.nextToken());
        int length=1;
        long ans=Integer.MIN_VALUE;
        for (int i=1;i<n;i++) {
          arr[i]=Long.parseLong(tk.nextToken());
            if (arr[i]<arr[i-1]) {
                length=1;
            }
            else
                length++;
            ans=Math.max(ans, length);
        }
        ans=Math.max(ans, length);
        out.write(ans+"\n");
        out.flush();
    }    
}