#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, maxs;
  int hig[1010];
  cin >> n;
  maxs = 0;
  for (int i = 0; i < n; i++) cin >> hig[i];
  for (int j = 0; j < n; j++) {
    int localhi = 1;
    for (int i = j; i < n - 1; i++)
      if (hig[i] >= hig[i + 1])
        localhi++;
      else
        break;
    for (int i = j; i > 0; i--)
      if (hig[i] >= hig[i - 1])
        localhi++;
      else
        break;
    if (maxs < localhi) maxs = localhi;
  }
  cout << maxs;
}
