sdnu1696

 

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e9+10;
ll f[500010],l[500010],r[500010];
ll n;

int main ()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>f[i];
    }
    ll sum=0;
    l[1]=1;
    r[n]=n;
    for(int i=2;i<=n;i++)
    {
        l[i]=(f[i-1]<=f[i]?l[i-1]:i);
    }
    for(int i=n-1;i>0;i--) r[i]=(f[i]>=f[i+1]?r[i+1]:i);
    for(int i=1;i<=n;i++) sum=max(sum,r[i]-l[i]+1);
    cout<<sum<<endl;
    //cout<<r[3]<<' '<<l[3]<<endl;
    return 0;
}