#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, a[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    int t = 1;
    for (int j = i + 1; j <= n; j++)
      if (a[j - 1] >= a[j]) {
        t++;
      } else
        break;
    for (int j = i - 1; j >= 1; j--)
      if (a[j] <= a[j + 1]) {
        t++;
      } else
        break;
    ans = max(ans, t);
  }
  cout << ans << endl;
  return 0;
}
