#include <bits/stdc++.h>
using namespace std;
int n, i, j, t[1000], p[1000], maxm;
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> t[i];
  }
  i = -1;
  while (i < n) {
    i++;
    p[i] = 1;
    for (j = i; j < n - 1; j++) {
      if (t[j] < t[j + 1])
        break;
      else
        p[i]++;
    }
    for (j = i; j > 0; j--) {
      if (t[j] < t[j - 1])
        break;
      else
        p[i]++;
    }
  }
  for (i = 0; i < n; i++) {
    if (p[i] > maxm) maxm = p[i];
  }
  cout << maxm << endl;
}
