#include <bits/stdc++.h>
using namespace std;
template <class T>
bool ckmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
void read(vector<long long int> &a, int n) {
  a.resize(n);
  for (int i = 0; i < n; i++) cin >> a[i];
}
bool fine = 0;
vector<long long int> a;
long long int n, m;
void solve() {
  cin >> n;
  read(a, n);
  long long int ans = 1;
  if (n == 1) {
    cout << 1 << "\n";
    return;
  }
  for (int i = 0; i < n; i++) {
    long long int temp = 1;
    bool ok = true;
    for (int j = i; j < n; j++) {
      if (j != n - 1 && ok) {
        if (a[j + 1] >= a[j]) {
          temp++;
        } else {
          ok = false;
          continue;
        }
      }
      if (j != 0 && !ok) {
        if (a[j] <= a[j - 1]) {
          temp++;
        } else
          break;
      }
    }
    ckmax(ans, temp);
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  if (fine) {
    int t;
    cin >> t;
    while (t--) {
      solve();
    }
  } else
    solve();
  return 0;
}
