#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, ans = 0;
  scanf("%d", &n);
  int x[n];
  for (int i = 0; i < n; i++) {
    scanf("%d", &x[i]);
  }
  int c = 1;
  for (int i = 1; i < n; i++) {
    if (x[i] <= x[0] && x[i] <= x[i - 1])
      c++;
    else
      break;
  }
  ans = max(c, ans);
  c = 1;
  for (int i = n - 2; i >= 0; i--) {
    if (x[i] <= x[n - 1] && x[i] <= x[i + 1])
      c++;
    else
      break;
  }
  ans = max(c, ans);
  if (ans == n) {
    printf("%d", ans);
    return 0;
  }
  for (int i = 1; i < n - 1; i++) {
    int m = 1;
    for (int j = i + 1; j < n; j++) {
      if (x[j] <= x[i] && x[j] <= x[j - 1])
        m++;
      else
        break;
    }
    for (int l = i - 1; l >= 0; l--) {
      if (x[l] <= x[i] && x[l] <= x[l + 1])
        m++;
      else
        break;
    }
    ans = max(m, ans);
  }
  printf("%d", ans);
  return 0;
}
