#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7f7f7f7f;
int BigMod(long long int B, long long int P, long long int M) {
  long long int R = 1;
  while (P > 0) {
    if (P % 2 == 1) R = (R * B) % M;
    P /= 2;
    B = (B * B) % M;
  }
  return (int)R;
}
int main() {
  long long int n, m = 1, x, y, s = 1;
  cin >> n;
  cin >> x;
  for (long long int i = 2; i <= n; i++) {
    cin >> y;
    if (y >= x)
      m += 1;
    else
      m = 1;
    x = y;
    if (m > s) s = m;
  }
  cout << s;
  return 0;
}
