#include <bits/stdc++.h>
using namespace std;
int main() {
  int best = 0, atm, i, n, k, g;
  cin >> n;
  int heights[n];
  for (i = 0; i < n; i++) cin >> heights[i];
  for (i = 0; i < n; i++) {
    atm = 1;
    k = i;
    g = heights[i];
    while (k > 0 && heights[k - 1] <= g) {
      atm++;
      g = heights[k - 1];
      k--;
    }
    k = i;
    g = heights[i];
    while (k < n - 1 && heights[k + 1] <= g) {
      atm++;
      g = heights[k + 1];
      k++;
    }
    if (atm > best) best = atm;
  }
  cout << best << endl;
  return 0;
}
