#include <bits/stdc++.h>
using namespace std;
long long res = 1;
long long countn = 1;
void solve(long long a[], long long n) {
  if (n == 0) {
    res = max(countn, res);
    cout << res;
  } else if (a[n] >= a[n - 1]) {
    countn++;
    solve(a, n - 1);
  } else {
    res = max(countn, res);
    countn = 1;
    solve(a, n - 1);
  }
}
int main() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  solve(a, n - 1);
  return 0;
}
