#include #define be(v) (v).begin(),(v).end() #define pb(q) push_back(q) #define rep(i, n) for(int i=0;i> n; vector a(n); rep(i, n) cin >> a[i]; int ans = 0; rep(i, n - 2) { set s; rep(j, 3) s.insert(a[i+j]); if(s.size() == 3) { if(*s.begin() == a[i + 1] || *s.rbegin() == a[i + 1]) { ans ++; } } } cout << ans << endl; return 0; }