import java.io.*;
import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        final int N = Integer.parseInt(sc.next());
        long[] h = new long[N];
        for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        }
        int max = 0;
        int cnt = 0;
        
        for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        }
        
        out.println(max);
        
        out.flush();
    }
} import java.io.*; io.* java import java.util.*; util.* java public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        final int N = Integer.parseInt(sc.next());
        long[] h = new long[N];
        for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        }
        int max = 0;
        int cnt = 0;
        
        for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        }
        
        out.println(max);
        
        out.flush();
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        final int N = Integer.parseInt(sc.next());
        long[] h = new long[N];
        for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        }
        int max = 0;
        int cnt = 0;
        
        for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        }
        
        out.println(max);
        
        out.flush();
    } main {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        final int N = Integer.parseInt(sc.next());
        long[] h = new long[N];
        for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        }
        int max = 0;
        int cnt = 0;
        
        for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        }
        
        out.println(max);
        
        out.flush();
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) PrintWriter out = new PrintWriter(System.out); out new PrintWriter(System.out) final int N = Integer.parseInt(sc.next()); N Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc long[] h = new long[N]; h new long[N] N for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            h[i] = Long.parseLong(sc.next());
        } {
            h[i] = Long.parseLong(sc.next());
        } h[i] = Long.parseLong(sc.next()) h[i] h i Long.parseLong(sc.next()) Long.parseLong Long sc.next() sc.next sc int max = 0; max 0 int cnt = 0; cnt 0 for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        } int i = 0; int i = 0; i 0 i < N - 1 i N - 1 N 1 i++ i++ i {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        } {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        } if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            } h[i] >= h[i+1] h[i] h i h[i+1] h i+1 i 1 {
                cnt++;
                max = Math.max(max, cnt);
            } cnt++ cnt max = Math.max(max, cnt) max Math.max(max, cnt) Math.max Math max cnt {
                cnt = 0;
            } cnt = 0 cnt 0 out.println(max) out.println out max out.flush() out.flush out String[] args args public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        final int N = Integer.parseInt(sc.next());
        long[] h = new long[N];
        for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        }
        int max = 0;
        int cnt = 0;
        
        for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        }
        
        out.println(max);
        
        out.flush();
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        final int N = Integer.parseInt(sc.next());
        long[] h = new long[N];
        for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        }
        int max = 0;
        int cnt = 0;
        
        for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        }
        
        out.println(max);
        
        out.flush();
    }
} Main
import java.io.*;
import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        final int N = Integer.parseInt(sc.next());
        long[] h = new long[N];
        for (int i = 0; i < N; i++) {
            h[i] = Long.parseLong(sc.next());
        }
        int max = 0;
        int cnt = 0;
        
        for (int i = 0; i < N - 1; i++) {
            if (h[i] >= h[i+1]) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                cnt = 0;
            }
        }
        
        out.println(max);
        
        out.flush();
    }
}