#include <bits/stdc++.h>
int a[100005], z, k = 1, max;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n; i++) {
    while (i < n) {
      int y = i + 1;
      if (a[i] < a[y] || a[i] == a[y]) {
        k++;
      } else
        break;
      i++;
    }
    if (max < k) {
      max = k;
    }
    k = 1;
  }
  printf("%d", max);
}
