#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	
	auto func = [N](vector<int> A, bool rev, bool mins) {
		vector<int> res(N);
		vector<int> dp(N, INF);
		if (rev) reverse(ALL(A));
		REP(i, N) {
			const int a = mins ? -A[i] : A[i];
			int p = lower_bound(ALL(dp), a) - dp.begin();
			dp[p] = a;
			res[i] = p + 1;
		}
		if (rev) reverse(ALL(res));
		return res;
	};
	
	auto rl = func(A, false, false);
	auto rr = func(A, true, false);
	auto ll = func(A, false, true);
	auto lr = func(A, true, true);
	int ans = 0;
	REP(i, N) {
		chmax(ans, max(ll[i], lr[i]) - 1);
		chmax(ans, max(rl[i], rr[i]) - 1);
	}
	cout << ans << endl;
}