#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n], dp[n + 1];
  memset(dp, 0, sizeof(dp));
  dp[0] = 1;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (i > 0) {
      if (a[i] >= a[i - 1]) {
        dp[i] = dp[i - 1] + 1;
      } else {
        dp[i] = 1;
      }
    }
  }
  cout << *max_element(dp, dp + n);
  return 0;
}
