#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, ar[1005], i, j, maxi = 0, cnt;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> ar[i];
  }
  for (i = 0; i < n; i++) {
    j = i;
    cnt = 0;
    while (ar[j] >= ar[j + 1] && j < n - 1) {
      cnt++;
      j++;
    }
    j = i;
    while (ar[j] >= ar[j - 1] && j > 0) {
      cnt++;
      j--;
    }
    maxi = max(maxi, cnt);
  }
  cout << maxi + 1;
  return 0;
}
