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.
/**
 * Created by shambala on 22/09/15.
 */
import java.util.*;
import java.io.*;

public class TaskA {

    FastScanner in;
    PrintWriter out;

    public void solve() throws IOException {
        int max = 1;
        int cur = 1;
        for (int i = 1; i<n; i++) {
            if (mas[i]>=mas[i-1]) {
                cur++;
            } else {
                if (cur>max) {
                    max = cur;
                }
                cur = 1;
            }
        }
        if (cur>max) {
            max = cur;
        }
        System.out.println(max);
    }
    int n;
    int[] mas;
    public void run() {
        try {
            in = new FastScanner();
            //out = new PrintWriter(new File(".out"));
            n = in.nextInt();
            mas = new int[n];
            for (int i = 0; i<n; i++) {
                mas[i] = in.nextInt();
            }
            solve();

        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

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

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

    public static void main(String[] arg) {
        new TaskA().run();
    }
}

