#include <bits/stdc++.h>
using namespace std;
int rain(int n, int *T, int i) {
  int r = 1;
  int d = i + 1, g = i - 1, ex = i;
  while ((g >= 0) && (T[g] <= T[i])) {
    r++;
    i = g;
    g--;
  }
  i = ex;
  while ((d < n) && (T[d] <= T[i])) {
    r++;
    i = d;
    d++;
  }
  return r;
}
int max(int n, int *T) {
  int x;
  x = rain(n, T, 0);
  for (int i = 1; i < n; i++) {
    if (rain(n, T, i) > x) x = rain(n, T, i);
  }
  return x;
}
int main() {
  int *T;
  int n;
  cin >> n;
  T = new int[n];
  for (int i = 0; i < n; i++) cin >> T[i];
  cout << max(n, T);
  return 0;
}
