#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
template<int T> using A = array<int, T>;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
const int maxn = 1e6;
const int inf = 2e9;
int n, a[maxn + 5];
int main() {
	//freopen("in.txt", "r", stdin);
	n = read();
	rep(i, 1, n) a[i] = read();
	int mx = -1;
	rep(i, 1, n) {
		int res = 1, l = i, r = i;
		while(l > 1 && r < n && a[l - 1] == a[r + 1] && a[l] > a[l - 1]) {
			res += 2;
			l --, r ++;
		}
		if(res != 1) chkmx(mx, res);
	}
	cout << mx << '\n';
	return 0;
}