import java.util.Scanner;
class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] a = new int[N];
    int[] b = new int[N-1];
    
    for(int i=0;i<N;i++){
      a[i] = sc.nextInt();
    }
    
    for(int j=0;j<N-1;j++){
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    }
    
    int  b_max = 0;
    int count = 0;
    for(int c=0;c<N-1;c++){
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    }
    if(count>b_max){
          b_max = count;
    }
    System.out.println(b_max);
  }
} import java.util.Scanner; Scanner java.util class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] a = new int[N];
    int[] b = new int[N-1];
    
    for(int i=0;i<N;i++){
      a[i] = sc.nextInt();
    }
    
    for(int j=0;j<N-1;j++){
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    }
    
    int  b_max = 0;
    int count = 0;
    for(int c=0;c<N-1;c++){
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    }
    if(count>b_max){
          b_max = count;
    }
    System.out.println(b_max);
  }
} Main public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] a = new int[N];
    int[] b = new int[N-1];
    
    for(int i=0;i<N;i++){
      a[i] = sc.nextInt();
    }
    
    for(int j=0;j<N-1;j++){
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    }
    
    int  b_max = 0;
    int count = 0;
    for(int c=0;c<N-1;c++){
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    }
    if(count>b_max){
          b_max = count;
    }
    System.out.println(b_max);
  } main {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] a = new int[N];
    int[] b = new int[N-1];
    
    for(int i=0;i<N;i++){
      a[i] = sc.nextInt();
    }
    
    for(int j=0;j<N-1;j++){
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    }
    
    int  b_max = 0;
    int count = 0;
    for(int c=0;c<N-1;c++){
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    }
    if(count>b_max){
          b_max = count;
    }
    System.out.println(b_max);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] a = new int[N]; a new int[N] N int[] b = new int[N-1]; b new int[N-1] N-1 N 1 for(int i=0;i<N;i++){
      a[i] = sc.nextInt();
    } int i=0; int i=0; i 0 i<N i N i++ i++ i {
      a[i] = sc.nextInt();
    } {
      a[i] = sc.nextInt();
    } a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc for(int j=0;j<N-1;j++){
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    } int j=0; int j=0; j 0 j<N-1 j N-1 N 1 j++ j++ j {
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    } {
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    } if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      } a[j+1]<=a[j] a[j+1] a j+1 j 1 a[j] a j {
        b[j] = 1;
      } b[j] = 1 b[j] b j 1 {
        b[j] = 0;
      } b[j] = 0 b[j] b j 0 int  b_max = 0; b_max 0 int count = 0; count 0 for(int c=0;c<N-1;c++){
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    } int c=0; int c=0; c 0 c<N-1 c N-1 N 1 c++ c++ c {
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    } {
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    } if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      } b[c]==1 b[c] b c 1 {
        count++;
      } count++ count {
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      } if(count>b_max){
          b_max = count;
        } count>b_max count b_max {
          b_max = count;
        } b_max = count b_max count count = 0 count 0 if(count>b_max){
          b_max = count;
    } count>b_max count b_max {
          b_max = count;
    } b_max = count b_max count System.out.println(b_max) System.out.println System.out System System.out b_max String[] args args
import java.util.Scanner;
class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] a = new int[N];
    int[] b = new int[N-1];
    
    for(int i=0;i<N;i++){
      a[i] = sc.nextInt();
    }
    
    for(int j=0;j<N-1;j++){
      if(a[j+1]<=a[j]){
        b[j] = 1;
      }else{
        b[j] = 0;
      }
    }
    
    int  b_max = 0;
    int count = 0;
    for(int c=0;c<N-1;c++){
      if(b[c]==1){
        count++;
      }else{
        if(count>b_max){
          b_max = count;
        }
        count = 0;
      }
    }
    if(count>b_max){
          b_max = count;
    }
    System.out.println(b_max);
  }
}