#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
bool isPrime(int x) {
  if (x < 2) {
    return false;
  } else if (x > 2 and x % 2 == 0) {
    return false;
  } else {
    for (int i = 3; i * i <= x; i += 2) {
      if (x % i == 0) {
        return false;
      }
    }
  }
  return true;
}
void solve() {
  int n;
  cin >> n;
  if (n == 1) {
    cout << 1;
    return;
  }
  int arr[n + 1];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int maks = 1, kanan = 0, kiri = 0;
  for (int i = 0; i < n; i++) {
    int cnt = 1;
    for (int t = i - 1; t > -1 && arr[t] <= arr[t + 1]; t--) {
      cnt++;
    }
    for (int t2 = i + 1; t2 < n + 1 && arr[t2] <= arr[t2 - 1]; t2++) {
      cnt++;
    }
    maks = max(maks, cnt);
  }
  cout << maks;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int x = 1;
  while (x--) {
    solve();
  }
  cout << "\n";
}
