#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n;
  cin >> n;
  long long int a[n], i, j, k, b[n];
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < n; i++) {
    long long int count = 0;
    k = i;
    for (j = i + 1; j < n; j++) {
      if (a[j] <= a[k]) {
        count++;
        b[i] = count;
        k++;
      } else {
        b[i] = count;
        break;
      }
    }
    k = i;
    for (j = i - 1; j >= 0; j--) {
      if (a[j] <= a[k]) {
        count++;
        b[i] = count;
        k--;
      } else {
        b[i] = count;
        break;
      }
    }
  }
  cout << *max_element(b, b + n) + 1 << endl;
}
