#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

const int maxn = 2000010;

int n;
int a[maxn], dp[maxn][2];

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

	cin >> n;
	for (int i = 1; i <= n; i ++)
		cin >> a[i];

	for (int i = 1; i <= n; i ++) {
		dp[i][0] = dp[i][1] = 1;
		for (int j = i - 1; i - j + 1 <= 10 && j >= 1; j -- ) {
			if (a[j] > a[i]) dp[i][0] = max(dp[i][0], dp[j][1] + 1);
			if (a[j] < a[i]) dp[i][1] = max(dp[i][1], dp[j][0] + 1);
		}
	}

	cout << max(dp[n][0], dp[n][1]) << endl;

	return 0;
}