#include <bits/stdc++.h>
using namespace std;
int x[2000];
int dx[2] = {1, -1};
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < (int)n; i++) scanf("%d", &x[i]);
  int mx = 0;
  for (int i = 0; i < (int)n; i++) {
    int ans = 1;
    for (int g = 0; g < (int)2; g++)
      for (int j = i + dx[g]; j >= 0 && j < n; j += dx[g]) {
        if (x[j] > x[j - dx[g]]) break;
        ans++;
      }
    mx = max(ans, mx);
  }
  cout << mx << endl;
  return 0;
}
