#include <bits/stdc++.h>
using namespace std;
long long int mod;
long long int power(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b % 2 == 1) return (power(a, b - 1) * a) % mod;
  long long int q = power(a, b / 2);
  return (q * q) % mod;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long int ans = 1;
  for (long long int i = 0; i < n; i++) {
    long long int cnt = 0;
    long long int prev = a[i];
    for (long long int j = i - 1; j >= 0; j--) {
      if (a[j] <= prev) {
        prev = a[j];
        cnt++;
      } else
        break;
    }
    prev = a[i];
    for (long long int j = i + 1; j < n; j++) {
      if (a[j] <= prev) {
        prev = a[j];
        cnt++;
      } else
        break;
    }
    cnt++;
    ans = max(ans, cnt);
  }
  cout << ans << endl;
  return 0;
}
