#include <bits/stdc++.h>
using namespace std;
int N, C;
int A[1001];
vector<int> V;
int main() {
  cin >> N;
  for (int i = 0; i < N; ++i) cin >> A[i];
  for (int i = 0; i < N; ++i) {
    C = 1;
    for (int j = i; j < N - 1; ++j) {
      if (A[j] >= A[j + 1])
        ++C;
      else
        break;
    }
    for (int j = i; j > 0; --j) {
      if (A[j] >= A[j - 1])
        ++C;
      else
        break;
    }
    V.push_back(C);
  }
  sort(V.begin(), V.end());
  cout << V[V.size() - 1] << "\n";
  return 0;
}
