#include <bits/stdc++.h>
using namespace std;
int height[1005], watered[1005];
int main() {
  int n;
  scanf("%d", &n);
  memset(height, 0, sizeof(height));
  memset(watered, 0, sizeof(watered));
  for (int i = 0; i < n; i++) {
    scanf("%d", &height[i]);
  }
  for (int i = 0; i < n; i++) {
    watered[i]++;
    for (int j = i + 1; height[j] <= height[j - 1] && j < n; j++) watered[i]++;
    for (int j = i - 1; height[j] <= height[j + 1] && j >= 0; j--) watered[i]++;
  }
  int ret = 0;
  for (int i = 0; i < n; i++) ret = max(ret, watered[i]);
  cout << ret << endl;
  return 0;
}
