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