#pragma warning (disable: 4996)
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int l1[100010], r1[100010], l2[100010], r2[100010];
int a[100010];
int main() {
	int n;
	cin >> n;
	vector<int> dp, dp1, dp2, dp3;
	dp.emplace_back(1000000007);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		auto it = lower_bound(dp.begin(), dp.end(), a[i]);
		if (it == dp.end()) {
			dp.emplace_back(a[i]);
		}
		else {
			*it = a[i];
		}
		l1[i] = dp.size();
	}
	dp1.emplace_back(1000000007);
	for (int i = n - 1; i >= 0; i--) {
		auto it = lower_bound(dp1.begin(), dp1.end(), a[i]);
		if (it == dp1.end()) {
			dp1.emplace_back(a[i]);
		}
		else {
			*it = a[i];
		}
		r1[i] = dp1.size();
	}
	for (int i = 0; i < n; i++) {
		a[i] *= -1;
	}
	dp2.emplace_back(1000000007);
	for (int i = 0; i < n; i++) {
		auto it = lower_bound(dp2.begin(), dp2.end(), a[i]);
		if (it == dp2.end()) {
			dp2.emplace_back(a[i]);
		}
		else {
			*it = a[i];
		}
		l2[i] = dp2.size();
	}
	dp3.emplace_back(1000000007);
	for (int i = n - 1; i >= 0; i--) {
		auto it = lower_bound(dp3.begin(), dp3.end(), a[i]);
		if (it == dp3.end()) {
			dp3.emplace_back(a[i]);
		}
		else {
			*it = a[i];
		}
		r2[i] = dp3.size();
	}
	int ans = 0;
	for (int i = 0; i < n; i++) {
		if (min(l1[i], r1[i]) > ans) {
			ans = min(l1[i], r1[i]);
		}
		if (min(l2[i], r2[i]) > ans) {
			ans = min(l2[i], r2[i]);
		}
	}
	cout << ans - 1 << endl;
	return 0;
}