#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

VI f(const VI& a)
{
	int n = SZ(a);
	VI res(n);
	stack<PII> s;
	FOR(i, 0, n)
	{
		int dp = -1;
		while (!s.empty() && s.top().F < a[i])
		{
			dp = max(dp + 1, s.top().S);
			s.pop();
		}
		s.push({a[i], dp + 1});
		res[i] = dp + SZ(s);
		if (i > 0)
			res[i] = max(res[i], res[i - 1]);
	}
	return res;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	VI a(n);
	for (int& ai : a)
		cin >> ai;
	VI pref = f(a);
	reverse(ALL(a));
	VI suf = f(a);
	reverse(ALL(suf));
	int ans = *max_element(ALL(pref));
	FOR(i, 0, n - 1)
	{
		ans = max(ans, pref[i] + suf[i + 1] + 1);
	}
	cout << ans << "\n";
	return 0;
}