kefa boi

#include <iostream>
using namespace std;

int main(){
    //input
    int n,count=1,maxcount=count;
    cin>>n;
    int seq[n];

    for(int i=0;i<n;i++){
        cin>>seq[i];
        if(i>0){
            if(seq[i]>=seq[i-1]){
                count++;
                maxcount=count;
            }
            else{
                count=1;
            }
        }
    }
    //output
    cout<<endl<<maxcount;
    return 0;
}