#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int h[N], up[N], down[N];
int main()
{
    int n; scanf("%d", &n);
    for (int i = 1; i <= n; i ++ )scanf("%d", &h[i]);
    
    for (int i = 1; i <= n; i ++ )
        up[i] = h[i] >= h[i - 1] ? up[i - 1] + 1 : 1;
    for (int i = n; i >= 1; i -- )
        down[i] = h[i] >= h[i + 1] ? down[i + 1] + 1 : 1;

    int ans = 0;
    for (int i = 1; i <= n; i ++ ) ans = max(ans, up[i] + down[i] - 1);
    printf("%d\n", ans);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int h[N], up[N], down[N];
int main()
{
	int n; scanf("%d", &n);
	for (int i = 1; i <= n; i ++ )scanf("%d", &h[i]);
	
	for (int i = 1; i <= n; i ++ )
		up[i] = h[i] >= h[i - 1] ? up[i - 1] + 1 : 1;
	for (int i = n; i >= 1; i -- )
		down[i] = h[i] >= h[i + 1] ? down[i + 1] + 1 : 1;

	int ans = 0;
    for (int i = 1; i <= n; i ++ ) ans = max(ans, up[i] + down[i] - 1);
	printf("%d\n", ans);
	return 0;
}