#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define chmin(a, b) ((b) < a && (a = (b), true))
#define chmax(a, b) (a < (b) && (a = (b), true))
using namespace std;
typedef long long ll;

struct SegmentTree {
	typedef pair<pair<int, int>, pair<int, int>> P; // (max1, l1, m1), (max2, m2, m2)
	vector<P> mx;
	int size;
	P e;
	SegmentTree(int n) {
		size = 1;
		e = {{0, -1}, {0, -1}};
		while (size < n) size *= 2;
		mx.resize(size * 2, e);
	}

	P merge(P a, P b) {
		pair<int, int> x[4] = {a.first, a.second, b.first, b.second};
		sort(x, x + 4);
		return P(x[3], x[2]);
	}

	void update(int k, int p, int v) {
		k += size - 1;
		mx[k] = merge(mx[k], {{v, p}, {-1, -1}});
		while (k > 0) {
			k = (k - 1) / 2;
			mx[k] = merge(mx[k * 2 + 1], mx[k * 2 + 2]);
		}
	}

	P query(int a, int b, int k, int l, int r) {
		if (r <= a || b <= l) return e;
		if (a <= l && r <= b) return mx[k];
		auto x = query(a, b, k * 2 + 1, l, (l + r) / 2);
		auto y = query(a, b, k * 2 + 2, (l + r) / 2, r);
		return merge(x, y);
	}

	P query(int a, int b) {
		return query(a, b, 0, 0, size);
	}
};

int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	rep (i, n) cin >> a[i];
	vector<int> ca(a);
	sort(ca.begin(), ca.end());
	ca.erase(unique(ca.begin(), ca.end()), ca.end());

	rep (i, n) a[i] = lower_bound(ca.begin(), ca.end(), a[i]) - ca.begin();
	SegmentTree inctr(101010), dectr(101010);

	rep (i, n) {
		int r = a[i];
		// dpinc[m][r] = max(dpdec[m+1..][..r-1])
		// =>
		// dpinc[m][r] = max(dpdec[..][..r-1])
		// dpinc[..r-1][r] = max(dpdec[..][..r-1])
		// dp[..r-1][r] = query: [..r-1] => (max,l)
		auto maxdec = dectr.query(0, r);
		if (maxdec.first.second != r) {
			inctr.update(r, r, maxdec.first.first + 1);
		} else {
			inctr.update(r, r, maxdec.second.first + 1);
		}
		// dpdec[m][r] = max(dpinc[..m-1][r+1..])
		// =>
		// dpdec[m][r] = max(dpinc[..][r+1..])
		// dpdec[r+1..][r] = max(dpinc[..][r+1..])
		// dp[r+1..][r] = query: [..r+1] => (max,l)
		auto maxinc = inctr.query(r + 1, inctr.size);
		if (maxinc.first.second != r) {
			dectr.update(r, r, maxinc.first.first + 1);
		} else {
			dectr.update(r, r, maxinc.second.first + 1);
		}
	}

	int ans = 0;
	ans = max(ans, inctr.query(0, inctr.size).first.first);
	ans = max(ans, dectr.query(0, dectr.size).first.first);
	cout << ans << endl;
	return 0;
}