#include <bits/stdc++.h>
using namespace std;
int maxAt(std::vector<int>& vector_name) {
  int max = INT_MIN;
  for (auto val : vector_name) {
    if (max < val) max = val;
  }
  return max;
}
int main() {
  int index;
  cin >> index;
  vector<int> height(index);
  vector<int> count(index, 1);
  for (int i = 0; i < index; i++) {
    cin >> height[i];
  }
  int i = 1, first = 0;
  while (i < index && height[first] >= height[i]) {
    i++;
    first++;
    count[0] += 1;
  }
  for (i = 1; i < index - 1; i++) {
    int before = i - 1, next = i;
    while (height[before] <= height[next] && before >= 0) {
      count[i] += 1;
      before--;
      next--;
    }
    int after = i + 1;
    next = i;
    while (height[next] >= height[after] && after < index) {
      count[i] += 1;
      after++;
      next++;
    }
  }
  i = index - 2, first = index - 1;
  while (i >= 0 && height[i] <= height[first]) {
    i--;
    first--;
    count[index - 1] += 1;
  }
  cout << maxAt(count);
  return 0;
}
