#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 1;
int arr[N];
int n;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  int mx = 0, cnt;
  for (int i = 0; i < n; i++) {
    cnt = 1;
    for (int j = i; j > 0; j--) {
      if (arr[j] < arr[j - 1]) break;
      cnt++;
    }
    for (int j = i; j < n - 1; j++) {
      if (arr[j] < arr[j + 1]) break;
      cnt++;
    }
    mx = max(mx, cnt);
  }
  cout << mx << endl;
}
