#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j, k, c = 0, max1 = 1;
  int *a, *b;
  cin >> n;
  a = (int *)malloc(sizeof(int) * n);
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < n; i++) {
    c = 0;
    c++;
    j = i - 1;
    k = i + 1;
    while (j >= 0 && a[j] <= a[j + 1]) {
      c++;
      j--;
    }
    while (k < n && a[k] <= a[k - 1]) {
      c++;
      k++;
    }
    if (max1 < c) max1 = c;
  }
  cout << max1;
  return 0;
}
