import java.util.Scanner;

class Main
{
    public static void main(String[] args)
    {
      //入力
      Scanner sc = new Scanner(System.in);
      int n = sc.nextInt();
      int[] h = new int[110000];
      for (int i=0; i<n; i++) h[i] = sc.nextInt();
      
      //移動
      int count;
      int max = 0;
      for(int start=0;start<n-1;start++) {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      }
      
      //出力
      System.out.println(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[] h = new int[110000];
      for (int i=0; i<n; i++) h[i] = sc.nextInt();
      
      //移動
      int count;
      int max = 0;
      for(int start=0;start<n-1;start++) {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      }
      
      //出力
      System.out.println(max);
      
    }
      
} Main public static void main(String[] args)
    {
      //入力
      Scanner sc = new Scanner(System.in);
      int n = sc.nextInt();
      int[] h = new int[110000];
      for (int i=0; i<n; i++) h[i] = sc.nextInt();
      
      //移動
      int count;
      int max = 0;
      for(int start=0;start<n-1;start++) {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      }
      
      //出力
      System.out.println(max);
      
    } main {
      //入力
      Scanner sc = new Scanner(System.in);
      int n = sc.nextInt();
      int[] h = new int[110000];
      for (int i=0; i<n; i++) h[i] = sc.nextInt();
      
      //移動
      int count;
      int max = 0;
      for(int start=0;start<n-1;start++) {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      }
      
      //出力
      System.out.println(max);
      
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] h = new int[110000]; h new int[110000] 110000 for (int i=0; i<n; i++) h[i] = sc.nextInt(); int i=0; int i=0; i 0 i<n i n i++ i++ i h[i] = sc.nextInt(); h[i] = sc.nextInt() h[i] h i sc.nextInt() sc.nextInt sc int count; count int max = 0; max 0 for(int start=0;start<n-1;start++) {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      } int start=0; int start=0; start 0 start<n-1 start n-1 n 1 start++ start++ start {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      } {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      } if(max>=n-start) break; max>=n-start max n-start n start break; count = 0 count 0 for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        } int now=start; int now=start; now start now<n-1 now n-1 n 1 now++ now++ now {
          if(h[now]>=h[now+1]) count++;
          else break;
        } {
          if(h[now]>=h[now+1]) count++;
          else break;
        } if(h[now]>=h[now+1]) count++;
          else break; h[now]>=h[now+1] h[now] h now h[now+1] h now+1 now 1 count++ count break; max = Math.max(max,count) max Math.max(max,count) Math.max Math max count System.out.println(max) System.out.println System.out System System.out 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[] h = new int[110000];
      for (int i=0; i<n; i++) h[i] = sc.nextInt();
      
      //移動
      int count;
      int max = 0;
      for(int start=0;start<n-1;start++) {
        if(max>=n-start) break;
        count = 0;
        for(int now=start;now<n-1;now++) {
          if(h[now]>=h[now+1]) count++;
          else break;
        }
        max = Math.max(max,count);
      }
      
      //出力
      System.out.println(max);
      
    }
      
}

