import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

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

    int gMax = 0;
    int lMax = 0;
    for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    }

    System.out.println(gMax);
  }
} import java.util.Scanner; Scanner java.util public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

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

    int gMax = 0;
    int lMax = 0;
    for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    }

    System.out.println(gMax);
  }
} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

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

    int gMax = 0;
    int lMax = 0;
    for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    }

    System.out.println(gMax);
  } main {
    Scanner sc = new Scanner(System.in);

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

    int gMax = 0;
    int lMax = 0;
    for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    }

    System.out.println(gMax);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc long[] H = new long[N]; H new long[N] N for (int i = 0; i < N; i++) {
        H[i] = sc.nextLong();
    } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
        H[i] = sc.nextLong();
    } {
        H[i] = sc.nextLong();
    } H[i] = sc.nextLong() H[i] H i sc.nextLong() sc.nextLong sc int gMax = 0; gMax 0 int lMax = 0; lMax 0 for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    } int i = 1; int i = 1; i 1 i < N i N i++ i++ i {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    } {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    } if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        } H[i] <= H[i-1] H[i] H i H[i-1] H i-1 i 1 {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } lMax++ lMax gMax = Math.max(gMax, lMax) gMax Math.max(gMax, lMax) Math.max Math gMax lMax {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        } lMax = 0 lMax 0 gMax = Math.max(gMax, lMax) gMax Math.max(gMax, lMax) Math.max Math gMax lMax System.out.println(gMax) System.out.println System.out System System.out gMax String[] args args public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

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

    int gMax = 0;
    int lMax = 0;
    for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    }

    System.out.println(gMax);
  }
} public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

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

    int gMax = 0;
    int lMax = 0;
    for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    }

    System.out.println(gMax);
  }
} Main
import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

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

    int gMax = 0;
    int lMax = 0;
    for (int i = 1; i < N; i++) {
        // System.out.println("H[i]=" + H[i] + ", H[i-1]=" + H[i-1]);
        if (H[i] <= H[i-1]) {
            lMax++;
            gMax = Math.max(gMax, lMax);
        } else {
            lMax = 0;
            gMax = Math.max(gMax, lMax);
        }
    }

    System.out.println(gMax);
  }
}