#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> v2;
  int n, *arr, i, size = 0, counter = 1;
  cin >> n;
  arr = new int[n];
  for (i = 0; i < n; i++) cin >> arr[i];
  for (i = 0; i < n - 1; i++) {
    if (arr[i] <= arr[i + 1]) {
      counter++;
    } else {
      v2.push_back(counter);
      counter = 1;
    }
  }
  v2.push_back(counter);
  sort(v2.begin(), v2.end());
  cout << v2.at(v2.size() - 1);
  return 0;
}
