#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
const double eps = 1e-11;
const int inf = (int)2e9;
const int mod = (int)1e9 + 7;
int a[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
  }
  int cnt = 0;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (!i) {
      cnt++;
      continue;
    } else {
      if (a[i] >= a[i - 1]) {
        cnt++;
      } else {
        ans = max(ans, cnt);
        cnt = 1;
      }
    }
  }
  ans = max(ans, cnt);
  printf("%d\n", ans);
  return 0;
}
