#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
long long mod_exp(long long x, long long y, long long mm) {
  if (y == 0)
    return (1);
  else if (y % 2 == 0)
    return (mod_exp((x * x) % mm, y / 2, mm));
  else
    return ((x * mod_exp((x * x) % mm, (y - 1) / 2, mm)) % mm);
}
bool isPowerOfTwo(long long n) {
  if (n == 0) return false;
  return (ceil(log2(n)) == floor(log2(n)));
}
void solve() {
  long long n;
  cin >> n;
  long long arr[n];
  for (long long i = 0; i < n; i++) cin >> arr[i];
  if (n == 1) {
    cout << 1 << "\n";
    return;
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    long long res = 0;
    long long x = arr[i];
    long long j = i;
    while (j < n && arr[j] >= arr[j + 1]) {
      j++;
    }
    res += (j - i + 1);
    j = i;
    while (j > 0 && arr[j] >= arr[j - 1]) {
      j--;
    }
    res += (i - j);
    ans = max(ans, res);
  }
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
