#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n;
int d[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) scanf("%d", &d[i]);
  int opt = 1;
  for (int i = 0; i < (n); ++i) {
    int l = i, r = i;
    while (l && d[l - 1] <= d[l]) l--;
    while (r + 1 < n && d[r + 1] <= d[r]) r++;
    opt = max(opt, r - l + 1);
  }
  printf("%d\n", opt);
}
