import java.util.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

        int max = 0;
        int cnt = 0;
        int cur = H[0];
        for (int i = 1; i < N; i++) {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        }

        System.out.println(max);
        return;
    }

} import java.util.*; util.* java class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
} Main public static void main(String[] args) {
        new Solver().run();
    } main {
        new Solver().run();
    } new Solver().run() new Solver().run new Solver() String[] args args class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

        int max = 0;
        int cnt = 0;
        int cur = H[0];
        for (int i = 1; i < N; i++) {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        }

        System.out.println(max);
        return;
    }

} Solver public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

        int max = 0;
        int cnt = 0;
        int cur = H[0];
        for (int i = 1; i < N; i++) {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        }

        System.out.println(max);
        return;
    } run {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

        int max = 0;
        int cnt = 0;
        int cur = H[0];
        for (int i = 1; i < N; i++) {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        }

        System.out.println(max);
        return;
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] H = new int[N]; H new int[N] N for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            H[i] = sc.nextInt();
        } {
            H[i] = sc.nextInt();
        } H[i] = sc.nextInt() H[i] H i sc.nextInt() sc.nextInt sc int max = 0; max 0 int cnt = 0; cnt 0 int cur = H[0]; cur H[0] H 0 for (int i = 1; i < N; i++) {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        } int i = 1; int i = 1; i 1 i < N i N i++ i++ i {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        } {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        } if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            } cur >= H[i] cur H[i] H i {
                cnt++;
            } cnt++ cnt {
                cnt = 0;
            } cnt = 0 cnt 0 max = Math.max(cnt, max) max Math.max(cnt, max) Math.max Math cnt max cur = H[i] cur H[i] H i System.out.println(max) System.out.println System.out System System.out max return;
import java.util.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] H = new int[N];

        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

        int max = 0;
        int cnt = 0;
        int cur = H[0];
        for (int i = 1; i < N; i++) {
            if (cur >= H[i]) {
                cnt++;
            } else {
                cnt = 0;
            }
            max = Math.max(cnt, max);
            cur = H[i];
        }

        System.out.println(max);
        return;
    }

}