#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> Height(n), count(n, 0);
  for (int i = 0; i < n; ++i) {
    cin >> Height[i];
  }
  int x = 0, after = 1, before = 0;
  while (after < n && Height[x] >= Height[after]) {
    count[0]++;
    x++;
    after++;
  }
  for (int i = 1; i < n - 1; i++) {
    x = i, after = i + 1, before = i - 1;
    while (before >= 0 && Height[x] >= Height[before]) {
      count[i]++;
      x--;
      before--;
    }
    x = i;
    while (after < n && Height[x] >= Height[after]) {
      count[i]++;
      x++;
      after++;
    }
  }
  x = n - 1, before = n - 2;
  while (after >= 0 && Height[x] >= Height[before]) {
    count[n - 1]++;
    x--;
    before--;
  }
  sort(count.begin(), count.end());
  cout << count[count.size() - 1] + 1;
}
