import java.util.Scanner;

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

    while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

      System.out.println(max);
    }
  }
} import java.util.Scanner; Scanner java.util public class Main {
  public static void main (String[] args) {
    Scanner in = new Scanner(System.in);

    while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

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

    while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

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

    while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

      System.out.println(max);
    }
  } Scanner in = new Scanner(System.in); in new Scanner(System.in) while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

      System.out.println(max);
    } in.hasNext() in.hasNext in {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

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

    while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

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

    while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

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

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

    while (in.hasNext()) {
      int N = in.nextInt();
      int[] H = new int[N];

      for (int i = 0; i < H.length; ++i) {
        H[i] = in.nextInt();
      }

      int max = 0;
      int count = 0;
      for (int i = 1; i < H.length; ++i) {
        if (H[i] <= H[i - 1]) {
          ++count;
        } else {
          max = Math.max(max, count);
          count = 0;
        }
      }
      max = Math.max(max, count);

      System.out.println(max);
    }
  }
}