#include <bits/stdc++.h>
using namespace std;
int cou(int v[], int ind, int x) {
  int count = 0;
  for (int l = ind; l > 0; --l) {
    if (v[l - 1] <= v[l]) {
      ++count;
    } else
      break;
  }
  for (int l = ind; l < x - 1; ++l) {
    if (v[l + 1] <= v[l]) {
      ++count;
    } else
      break;
  }
  return count + 1;
}
int main() {
  int x, v[1000], max = 0, ind, count = 0;
  cin >> x;
  for (int l = 0; l < x; ++l) {
    cin >> v[l];
  }
  for (int l = 0; l < x; ++l) {
    count = cou(v, l, x);
    if (max < count) max = count;
  }
  cout << max << endl;
  return 0;
}
