#include<bits/stdc++.h>
using namespace std;
int n;
int a[1010001];
int maxn=0;
int ans=0;
void dfs(int place){
	ans++;
	if(place!=1){
		for(int i=place;i>1;i--){
		if(a[i-1]<=a[i]) ans++;
		if(a[i-1]>a[i]) break; 
		}
	}
	if(place!=n){
		for(int i=place;i<n;i++){
			if(a[i+1]<=a[i]) ans++;
			if(a[i+1]>a[i]) break;
		}
	}
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		if(a[i]>a[i-1]&&a[i]>a[i+1]){
			dfs(i);
			maxn=max(maxn,ans);
			ans=0;
		}
	}
	cout<<maxn;
	return 0;
}