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