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

using namespace std;

int main(){

  int n,tmp;
  cin >> n;
  tmp = 0;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    v.push_back(a);
  }

  //昇順、降順を作り比較
  for (int i = 0; i < n - 2; i++) {
    vector<int> org,down,up;
    org = {v[i],v[i+1],v[i+2]};
    down = {v[i],v[i+1],v[i+2]};
    up = {v[i],v[i+1],v[i+2]};
    sort(down.begin(),down.end(),greater<int>());
    sort(up.begin(),up.end());
    //cout << up[0] << " ";
    if (down[0] != down[1] && down[1] != down[2] && up[0] != up[1] && up[1] != up[2] && org != down && org != up) {
        tmp++;
    }
  }
  cout << tmp << "\n";


  return 0;
}