#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int arr[n];
  int subs[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    subs[i] = 1;
  }
  int max_length = 1;
  for (int i = 1; i < n; i++) {
    if (arr[i] >= arr[i - 1]) {
      subs[i] = subs[i - 1] + 1;
    }
    max_length = max(max_length, subs[i]);
  }
  cout << max_length << endl;
}
