#include<bits/stdc++.h>
#define nxt(x) (x + 1) % n
#define lst(x) (x - 1 + n) % n
using namespace std;

void work()
{
	int n;
	cin >> n;
	deque<pair<int, int>> a;
	for(int i = 0; i < n; ++i){
		int x, y; cin >> x >> y;
		a.push_back({x, y});
	}
	while(a[0].second <= a[1].second){
		a.push_back(a.front());
		a.pop_front();
	}
	int l = 0, r = 0, ans = 0;
	auto dec = [&](int c1, int c2, int c3){
		int x1 = a[c1].first, x2 = a[c2].first, x3 = a[c3].first;
		int y1 = a[c1].second, y2 = a[c2].second, y3 = a[c3].second;
		return (x1 - x2)*(y3 - y2) < (x3 - x2)*(y1 - y2);
	};
	for(int i = 0; i < n; ++i)
	{
		if(a[nxt(i)].second != a[i].second){
			r = i;
			if(a[lst(l)].second > a[l].second && a[nxt(r)].second > a[r].second && dec(lst(l), l, nxt(r))){
				ans++;
			}
			l = nxt(i);
		}
	}
	cout << ans << "\n";
} 
 
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
//	cin >> t;
	while(t--)
		work();
}