#include <bits/stdc++.h>
using namespace std;
void read() {
  long long n;
  const long long maxn = 1e5 + 1;
  long long a[maxn], s[maxn], kq = -1;
  s[1] = 1;
  cin >> n;
  for (long long i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  for (long long i = 2; i <= n; ++i) {
    if (a[i - 1] <= a[i]) {
      s[i] = s[i - 1] + 1;
    } else {
      s[i] = 1;
    }
  }
  for (long long i = 1; i <= n; ++i) {
    kq = max(kq, s[i]);
  }
  cout << kq;
}
int main() { read(); }
