#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdio.h>
#include<map>
#include<vector>
#include<set>
#include<iomanip>
#define F first
#define S second
#define P system("PAUSE");
#define H return 0;
#define pb push_back
using namespace std;
const long long A=100000000000000LL,N=228228;
 
long long a[N],k,o,i,j,n,m;
 
int main(){
	cin>>n;
	for(i=0;i<n;i++)scanf("%d",&a[i]);
	k=1;
	for(i=1;i<n;i++)if(a[i]>=a[i-1])k++;else o=max(o,k),k=1;
	o=max(o,k);
	cout<<o;
}

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPG1hdGguaD4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZTxzdGRpby5oPgojaW5jbHVkZTxtYXA+CiNpbmNsdWRlPHZlY3Rvcj4KI2luY2x1ZGU8c2V0PgojaW5jbHVkZTxpb21hbmlwPgojZGVmaW5lIEYgZmlyc3QKI2RlZmluZSBTIHNlY29uZAojZGVmaW5lIFAgc3lzdGVtKCJQQVVTRSIpOwojZGVmaW5lIEggcmV0dXJuIDA7CiNkZWZpbmUgcGIgcHVzaF9iYWNrCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGxvbmcgbG9uZyBBPTEwMDAwMDAwMDAwMDAwMExMLE49MjI4MjI4OwoKbG9uZyBsb25nIGFbTl0sayxvLGksaixuLG07CgppbnQgbWFpbigpewoJY2luPj5uOwoJZm9yKGk9MDtpPG47aSsrKXNjYW5mKCIlZCIsJmFbaV0pOwoJaz0xOwoJZm9yKGk9MTtpPG47aSsrKWlmKGFbaV0+PWFbaS0xXSlrKys7ZWxzZSBvPW1heChvLGspLGs9MTsKCW89bWF4KG8sayk7Cgljb3V0PDxvOwp9

NyAxCjEgMCAxIDEgMCAwIDAKMSAyCjEgMwoyIDQKMiA1CjMgNgozIDcK

7 1
1 0 1 1 0 0 0
1 2
1 3
2 4
2 5
3 6
3 7