#include <bits/stdc++.h>
using namespace std;
static const int MAX_SIZE = 100005;
int n;
int salaries[MAX_SIZE];
void input() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &salaries[i]);
}
int solve() {
  int curSeq = 0, longestSeq = 0;
  for (int i = 0; i < n - 1; i++) {
    if (salaries[i] > salaries[i + 1]) {
      longestSeq = max(longestSeq, curSeq);
      curSeq = 0;
      continue;
    }
    curSeq++;
  }
  return (curSeq > longestSeq) ? curSeq + 1 : longestSeq + 1;
}
int main() {
  input();
  printf("%d\n", solve());
}
