import java.util.*;

public class Main{
    void solve(){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for(int i = 0; i < n; i++) h[i] = scan.nextInt();
        int c = 0;
        int out = -1;
        for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        }
        out = Math.max(out, c);
        System.out.println(out);
        scan.close();
    }

    public static void main(String[] args){
        new Main().solve();
    }
} import java.util.*; util.* java public class Main{
    void solve(){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for(int i = 0; i < n; i++) h[i] = scan.nextInt();
        int c = 0;
        int out = -1;
        for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        }
        out = Math.max(out, c);
        System.out.println(out);
        scan.close();
    }

    public static void main(String[] args){
        new Main().solve();
    }
} Main void solve(){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for(int i = 0; i < n; i++) h[i] = scan.nextInt();
        int c = 0;
        int out = -1;
        for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        }
        out = Math.max(out, c);
        System.out.println(out);
        scan.close();
    } solve {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for(int i = 0; i < n; i++) h[i] = scan.nextInt();
        int c = 0;
        int out = -1;
        for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        }
        out = Math.max(out, c);
        System.out.println(out);
        scan.close();
    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int n = scan.nextInt(); n scan.nextInt() scan.nextInt scan int[] h = new int[n]; h new int[n] n for(int i = 0; i < n; i++) h[i] = scan.nextInt(); int i = 0; int i = 0; i 0 i < n i n i++ i++ i h[i] = scan.nextInt(); h[i] = scan.nextInt() h[i] h i scan.nextInt() scan.nextInt scan int c = 0; c 0 int out = -1; out -1 1 for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 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]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        } {
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        } if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            } h[i] >= h[i + 1] h[i] h i h[i + 1] h i + 1 i 1 c++ c {
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            } if(c == 0) continue; c == 0 c 0 continue; out = Math.max(c, out) out Math.max(c, out) Math.max Math c out c = 0 c 0 out = Math.max(out, c) out Math.max(out, c) Math.max Math out c System.out.println(out) System.out.println System.out System System.out out scan.close() scan.close scan public static void main(String[] args){
        new Main().solve();
    } main {
        new Main().solve();
    } new Main().solve() new Main().solve new Main() String[] args args public class Main{
    void solve(){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for(int i = 0; i < n; i++) h[i] = scan.nextInt();
        int c = 0;
        int out = -1;
        for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        }
        out = Math.max(out, c);
        System.out.println(out);
        scan.close();
    }

    public static void main(String[] args){
        new Main().solve();
    }
} public class Main{
    void solve(){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for(int i = 0; i < n; i++) h[i] = scan.nextInt();
        int c = 0;
        int out = -1;
        for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        }
        out = Math.max(out, c);
        System.out.println(out);
        scan.close();
    }

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

public class Main{
    void solve(){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] h = new int[n];
        for(int i = 0; i < n; i++) h[i] = scan.nextInt();
        int c = 0;
        int out = -1;
        for(int i = 0; i < n - 1; i++){
            if(h[i] >= h[i + 1]) c++;
            else{
                if(c == 0) continue;
                out = Math.max(c, out);
                c = 0;
            }
        }
        out = Math.max(out, c);
        System.out.println(out);
        scan.close();
    }

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