#include <bits/stdc++.h>
int main(void) {
  int a, b, i, j, n, count, max = 0;
  scanf("%d", &n);
  int tall[n];
  for (i = 0; i < n; i++) scanf("%d", &tall[i]);
  for (i = 0; i < n; i++) {
    a = 1;
    b = 1;
    count = 1;
    for (j = 1; i - j >= 0 || i + j < n; j++) {
      if (i - j < 0)
        a = 0;
      else if (i + j >= n)
        b = 0;
      if (a) {
        if (tall[i - j] <= tall[i - j + 1])
          count++;
        else
          a = 0;
      }
      if (b) {
        if (tall[i + j] <= tall[i + j - 1])
          count++;
        else
          b = 0;
      }
      if (!a && !b) break;
    }
    if (count > max) max = count;
  }
  printf("%d\n", max);
  return 0;
}
