#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)2e5 + 10;
const long long INF = (long long)1e9 + 7;
vector<long long> v;
vector<long long> vec[MAXN];
long long n, ans, t, sum, k, x, m, b, a, y;
string s;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    v.push_back(x);
  }
  ans = 1;
  for (int i = 0; i < n - 1; i++) {
    if (v[i] <= v[i + 1]) {
      ans++;
      t = max(ans, t);
    } else {
      ans = 1;
    }
    t = max(ans, t);
  }
  cout << max(t, ans);
  return 0;
}
