#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <math.h>
#include <iomanip>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;

int main() {
	int n, k[105], ans = 0;
	cin >> n;
	for (int i = 0; i < n; ++i) { cin >> k[i]; }
	for (int i = 2; i < n; ++i) {
		if (((k[i - 1] > k[i] && k[i - 1] > k[i - 2]) || (k[i - 1] < k[i] && k[i - 1] < k[i - 2])) && k[i] != k[i - 2]) { ++ans; }
	}
	cout << ans << endl;
}