#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

#define for_n for(int i=0;i!=n; ++i)

int main()
{
long long n;
cin>>n;
vector<int> v,c;
for_n {int t; cin>>t; v.push_back(t);}
int sum=0;
for_n {for (int j=i; j<=v.size()-1&&v[j+1]<=v[j]; ++j) sum+=1;
       for (int j=i; j>=1&&v[j-1]<=v[j]; --j) sum+=1;
       c.push_back(sum);
       sum=0;
       }
int max=c[0];
for(int i=0;i!=v.size(); ++i) if (c[i]>max) max=c[i];
cout<<max+1;
}