#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int ans = 1;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    int j = i - 1;
    int ant = a[i];
    while (j >= 0 && a[j] <= ant) {
      ant = a[j];
      j--;
    }
    int k = i + 1;
    ant = a[i];
    while (k < n && a[k] <= ant) {
      ant = a[k];
      k++;
    }
    if (k == n && j == -1) {
      cout << n;
      return 0;
    }
    ans = max(ans, (k - j) - 1);
  }
  cout << ans;
}
