#include <bits/stdc++.h>
using namespace std;
int main() {
  long n;
  while (cin >> n) {
    long a[1002] = {0}, left[1002] = {0}, right[1002] = {0}, p = 1000000,
         mx = 0, i;
    for (i = 1; i <= n; i++) {
      cin >> a[i];
      if (p <= a[i])
        left[i] = left[i - 1] + 1;
      else
        left[i] = 0;
      p = a[i];
    }
    p = 10000000;
    for (i = n; i >= 1; i--) {
      if (p <= a[i])
        right[i] = right[i + 1] + 1;
      else
        right[i] = 0;
      p = a[i];
    }
    for (i = 1; i <= n; i++) {
      mx = max(mx, left[i] + right[i] + 1);
    }
    cout << mx << endl;
  }
  return 0;
}
