#include <bits/stdc++.h>
using namespace std;
int a[100000], i, j, l, n, ans;
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (i = 1; i <= n; i++) {
    for (j = i - 1; j >= 1; j--)
      if (a[j] > a[j + 1]) break;
    l = j;
    for (j = i + 1; j <= n; j++)
      if (a[j] > a[j - 1]) break;
    ans = max(ans, j - l - 1);
  }
  printf("%d", ans);
  return 0;
}
