#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long count = 1;
  if (n == 1) {
    cout << "1" << endl;
    return 0;
  }
  bool flag = 0;
  vector<int> possible;
  for (int i = 1; i < n; i++) {
    flag = 0;
    if (a[i] >= a[i - 1]) {
      count++;
      if (i == n - 1) flag = 1;
    } else {
      flag = 1;
    }
    if (flag) {
      possible.push_back(count);
      count = 1;
    }
  }
  cout << *max_element(possible.begin(), possible.end()) << '\n';
  return 0;
}
