Codeforces_580A

//Codeforces Round 580A
#include <iostream>
using namespace std;
int main()
{
    int n, answ=1, max=1, nn[100001];
    cin >> n;
    for(int i=0;i<n;i++)
    {
        cin >> nn[i];
    }
    for(int i=0;i<n;i++)
    {
        if(i!=0)
        {
            if(nn[i]>=nn[i-1])
            {
                answ++;
            }
            else
            {
                answ=1;
            }
            if(answ>max){max=answ;}
        }
    }
    cout << max;
    return 0;
}