#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;

	int A[100000];
	rep(i, N) cin >> A[i];

	int maeup[100001];
	int maedn[100001];
	int atoup[100001];
	int atodn[100001];

	deque<int> dq;
	rep(i, N) {
		auto itr = lower_bound(dq.begin(), dq.end(), A[i]);
		if (itr == dq.end()) {
			dq.pb(A[i]);
		}
		else *itr = A[i];
		maeup[i] = dq.size();
	}
	dq.clear();
	rep(i, N) {
		auto itr = upper_bound(dq.begin(), dq.end(), A[i]);
		if (itr == dq.begin()) {
			dq.push_front(A[i]);
		}
		else *(--itr) = A[i];
		maedn[i] = dq.size();
	}
	dq.clear();
	for (int i = N - 1; i >= 0; i--) {
		auto itr = lower_bound(dq.begin(), dq.end(), A[i]);
		if (itr == dq.end()) {
			dq.pb(A[i]);
		}
		else *itr = A[i];
		atodn[i] = dq.size();
	}
	dq.clear();
	for (int i = N - 1; i >= 0; i--) {
		auto itr = upper_bound(dq.begin(), dq.end(), A[i]);
		if (itr == dq.begin()) {
			dq.push_front(A[i]);
		}
		else *(--itr) = A[i];
		atoup[i] = dq.size();
	}

	int kotae = 0;
	rep(i, N) {
		chmax(kotae, min(maeup[i], atodn[i]));
		chmax(kotae, min(maedn[i], atoup[i]));
	}

	co(kotae - 1);

	Would you please return 0;
}