#include <bits/stdc++.h>
using namespace std;
int main() {
  long int n, ans = -1;
  cin >> n;
  vector<long int> v(n), dec(n, 0), inc(n, 0);
  for (int i = 0; i < n; i++) cin >> v[i];
  dec[0] = 0;
  for (int i = 1; i < n; i++) {
    if (v[i] >= v[i - 1])
      dec[i] = dec[i - 1] + 1;
    else
      dec[i] = 0;
  }
  inc[n - 1] = 0;
  for (int i = n - 2; i >= 0; i--)
    if (v[i] >= v[i + 1])
      inc[i] = inc[i + 1] + 1;
    else
      inc[i] = 0;
  for (int i = 0; i < n; i++) ans = max(ans, dec[i] + inc[i]);
  cout << ans + 1;
}
