#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

const int NMAX = 100000 + 5;

int n;
int v[NMAX];
int dp[NMAX];

void Read()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
}

int Back(int i)
{
    if(i > n)
        return 0;
    int k=i+1;
    while (v[i] >= v[k])
        ++k;
    return 1 + Back(k);
}

int main()
{
    int maxx;
    Read();
    dp[n]=1;
    for (int i = 1; i < n; ++i)
    {
        dp[i] = Back(i);
    }
    maxx=dp[1];
    for(int i = 2; i <= n; ++i)
       maxx = max(maxx, dp[i]);
    fout<<maxx;
    return 0;
}