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];
    long[] p = new long[n-1];

    for(int i=0; i<n; ++i)
      h[i] = sc.nextLong();

    for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    }

    int max1 = 0;
    int max2 = 0;
    for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    }

    System.out.println(Math.max(max1, max2));
  }
} 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];
    long[] p = new long[n-1];

    for(int i=0; i<n; ++i)
      h[i] = sc.nextLong();

    for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    }

    int max1 = 0;
    int max2 = 0;
    for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    }

    System.out.println(Math.max(max1, max2));
  }
} Main public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    long[] h = new long[n];
    long[] p = new long[n-1];

    for(int i=0; i<n; ++i)
      h[i] = sc.nextLong();

    for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    }

    int max1 = 0;
    int max2 = 0;
    for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    }

    System.out.println(Math.max(max1, max2));
  } main {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    long[] h = new long[n];
    long[] p = new long[n-1];

    for(int i=0; i<n; ++i)
      h[i] = sc.nextLong();

    for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    }

    int max1 = 0;
    int max2 = 0;
    for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    }

    System.out.println(Math.max(max1, max2));
  } 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 long[] p = new long[n-1]; p new long[n-1] n-1 n 1 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] h i sc.nextLong() sc.nextLong sc for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    } int i=0; int i=0; i 0 i<p.length i p.length p p.length ++i ++i i {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    } {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    } if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1; h[i] < h[i+1] h[i] h i h[i+1] h i+1 i 1 p[i] = 0 p[i] p i 0 p[i] = 1 p[i] p i 1 int max1 = 0; max1 0 int max2 = 0; max2 0 for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    } int i=0; int i=0; i 0 i<p.length i p.length p p.length ++i ++i i {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    } {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    } if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      } p[i] == 1 p[i] p i 1 {
        ++max1;
      } ++max1 max1 {
        max2 = Math.max(max1, max2);
        max1 = 0;
      } max2 = Math.max(max1, max2) max2 Math.max(max1, max2) Math.max Math max1 max2 max1 = 0 max1 0 System.out.println(Math.max(max1, max2)) System.out.println System.out System System.out Math.max(max1, max2) Math.max Math max1 max2 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];
    long[] p = new long[n-1];

    for(int i=0; i<n; ++i)
      h[i] = sc.nextLong();

    for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    }

    int max1 = 0;
    int max2 = 0;
    for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    }

    System.out.println(Math.max(max1, max2));
  }
} public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    long[] h = new long[n];
    long[] p = new long[n-1];

    for(int i=0; i<n; ++i)
      h[i] = sc.nextLong();

    for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    }

    int max1 = 0;
    int max2 = 0;
    for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    }

    System.out.println(Math.max(max1, max2));
  }
} 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];
    long[] p = new long[n-1];

    for(int i=0; i<n; ++i)
      h[i] = sc.nextLong();

    for(int i=0; i<p.length; ++i) {
      if(h[i] < h[i+1]) p[i] = 0;
      else p[i] = 1;
    }

    int max1 = 0;
    int max2 = 0;
    for(int i=0; i<p.length; ++i) {
      if( p[i] == 1 ) {
        ++max1;
      }
      else {
        max2 = Math.max(max1, max2);
        max1 = 0;
      }
    }

    System.out.println(Math.max(max1, max2));
  }
}