#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

#define TEN(x) ((ll)1e##x)

enum State{High, Low};

ll calc(const vector<ll> & a ,State s) {
	ll count = 0;
	ll prepre_size = (s==Low) ? 0 : TEN(6)+1;
	ll prev_size = (s==High) ? 0 : TEN(6)+1;
	for (auto& x : a) {
		if (prepre_size == x) {
			count++; continue;
		}

		if (s == High) {
			if (prev_size < x) {
				s = Low;
			} else {
				count++;
			}
		} else {
			if (prev_size > x) {
				s = High;
			} else {
				count++;
			}
		}
		prepre_size = prev_size;
		prev_size = x;
	}
	return a.size() - count;
}

int main(){
	ll n; cin >> n;
	vector<ll> a(n);
	for (auto& i : a) cin >> i;
	ll result = max(calc(a, Low), calc(a, High));
	if (result < 3) result = 0;
	cout << result << endl;
	return 0;
}