#include <bits/stdc++.h>
using namespace std;
int main() {
  int high[2000 + 10];
  int N;
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> high[i];
  int max = INT_MIN;
  for (int i = 1; i <= N; i++) {
    int tmp = high[i];
    int j, cnt = 1;
    for (j = i - 1; j >= 1; j--) {
      if (high[j] <= tmp) {
        cnt++;
        tmp = high[j];
      } else
        break;
    }
    tmp = high[i];
    for (j = i + 1; j <= N; j++) {
      if (high[j] <= tmp) {
        cnt++;
        tmp = high[j];
      } else
        break;
    }
    if (cnt > max) max = cnt;
  }
  printf("%d", max);
  return 0;
}
