#include <bits/stdc++.h>
using namespace std;
int a[10002];
int n;
int solve(int x) {
  int sm = 0;
  int tmp = a[x];
  for (int i = x; i < n; i++) {
    if (a[i] > tmp) break;
    sm++;
    tmp = a[i];
  }
  tmp = a[x];
  for (int i = x - 1; i >= 0; i--) {
    if (a[i] > tmp) break;
    sm++;
    tmp = a[i];
  }
  return sm;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int mx = 0;
  solve(1);
  for (int i = 0; i < n; i++) {
    if (solve(i) > mx) mx = solve(i);
  }
  cout << mx;
}
