import 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];
    H[0]=sc.nextLong();
    int t=0;
    int ans =0;
    for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);}
    System.out.println(ans);
  }
} import java.util.*; util.* java public class Main{
  public static void main(String[] args){
    Scanner sc =new Scanner(System.in);
    int N =sc.nextInt();
    long H[] =new long[N];
    H[0]=sc.nextLong();
    int t=0;
    int ans =0;
    for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);}
    System.out.println(ans);
  }
} Main public static void main(String[] args){
    Scanner sc =new Scanner(System.in);
    int N =sc.nextInt();
    long H[] =new long[N];
    H[0]=sc.nextLong();
    int t=0;
    int ans =0;
    for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);}
    System.out.println(ans);
  } main {
    Scanner sc =new Scanner(System.in);
    int N =sc.nextInt();
    long H[] =new long[N];
    H[0]=sc.nextLong();
    int t=0;
    int ans =0;
    for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);}
    System.out.println(ans);
  } 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 H[0]=sc.nextLong() H[0] H 0 sc.nextLong() sc.nextLong sc int t=0; t 0 int ans =0; ans 0 for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);} int i=1; int i=1; i 1 i<N i N i++ i++ i {
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);} {
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);} H[i]=sc.nextLong() H[i] H i sc.nextLong() sc.nextLong sc if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;} H[i-1]>=H[i] H[i-1] H i-1 i 1 H[i] H i {t=t+1;} t=t+1 t t+1 t 1 {t=0;} t=0 t 0 ans =Math.max(ans,t) ans Math.max(ans,t) Math.max Math ans t System.out.println(ans) System.out.println System.out System System.out ans 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];
    H[0]=sc.nextLong();
    int t=0;
    int ans =0;
    for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);}
    System.out.println(ans);
  }
} public class Main{
  public static void main(String[] args){
    Scanner sc =new Scanner(System.in);
    int N =sc.nextInt();
    long H[] =new long[N];
    H[0]=sc.nextLong();
    int t=0;
    int ans =0;
    for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);}
    System.out.println(ans);
  }
} Main
import 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];
    H[0]=sc.nextLong();
    int t=0;
    int ans =0;
    for(int i=1;i<N;i++){
      H[i]=sc.nextLong();
      if(H[i-1]>=H[i]){t=t+1;}
      else{t=0;}
      ans =Math.max(ans,t);}
    System.out.println(ans);
  }
}