#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int sol = 0;
  for (int i = 1; i <= n; i++) {
    int cnt = 1;
    for (int j = i - 1; j >= 1; j--) {
      if (a[j] > a[j + 1])
        break;
      else
        cnt++;
    }
    for (int k = i + 1; k <= n; k++) {
      if (a[k] > a[k - 1])
        break;
      else
        cnt++;
    }
    sol = max(sol, cnt);
  }
  cout << sol;
  return 0;
}
