Problem: Maria participates in a bicycle race.

The speedway takes place on the shores of Lake Lucerne, just repeating its contour. As you know, the lake shore consists only of straight sections, directed to the north, south, east or west.

Let's introduce a system of coordinates, directing the Ox axis from west to east, and the Oy axis from south to north. As a starting position of the race the southernmost point of the track is selected (and if there are several such points, the most western among them). The participants start the race, moving to the north. At all straight sections of the track, the participants travel in one of the four directions (north, south, east or west) and change the direction of movement only in bends between the straight sections. The participants, of course, never turn back, that is, they do not change the direction of movement from north to south or from east to west (or vice versa).

Maria is still young, so she does not feel confident at some turns. Namely, Maria feels insecure if at a failed or untimely turn, she gets into the water. In other words, Maria considers the turn dangerous if she immediately gets into the water if it is ignored.

Help Maria get ready for the competition — determine the number of dangerous turns on the track.

Input

The first line of the input contains an integer n (4 ≤ n ≤ 1000) — the number of straight sections of the track.

The following (n + 1)-th line contains pairs of integers (xi, yi) ( - 10 000 ≤ xi, yi ≤ 10 000). The first of these points is the starting position. The i-th straight section of the track begins at the point (xi, yi) and ends at the point (xi + 1, yi + 1).

It is guaranteed that:

  * the first straight section is directed to the north; 
  * the southernmost (and if there are several, then the most western of among them) point of the track is the first point; 
  * the last point coincides with the first one (i.e., the start position); 
  * any pair of straight sections of the track has no shared points (except for the neighboring ones, they share exactly one point); 
  * no pair of points (except for the first and last one) is the same; 
  * no two adjacent straight sections are directed in the same direction or in opposite directions. 

Output

Print a single integer — the number of dangerous turns on the track.

Examples

Input

6
0 0
0 1
1 1
1 2
2 2
2 0
0 0


Output

1


Input

16
1 1
1 5
3 5
3 7
2 7
2 9
6 9
6 7
5 7
5 3
4 3
4 4
3 4
3 2
5 2
5 1
1 1


Output

6

Note

The first sample corresponds to the picture:

<image>

The picture shows that you can get in the water under unfortunate circumstances only at turn at the point (1, 1). Thus, the answer is 1.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double pi = atan(1.) * 4.;
const int max_n = 1e5 + 100;
const long long mod = 1e9 + 7;
struct Node {
  int x;
  int y;
};
int mapp[4100][4100];
int xx[2100];
int yy[2100];
void fun(int x1, int y1, int x2, int y2) {
  int m = min(x1, x2);
  int n = max(x1, x2);
  int k = max(y1, y2);
  for (int i = m; i <= n; i++) {
    for (int j = min(y1, y2); j <= k; j++) {
      mapp[i][j] = 1;
    }
  }
}
bool isfun(int x, int y) {
  bool flag1 = false, flag2 = false, flag4 = false, flag3 = false;
  for (int i = x; i >= 0 && !flag1; i--) {
    if (mapp[i][y] == 1 && abs(i - x) > 1) flag1 = true;
  }
  for (int i = x; i <= 2050 && !flag2; i++) {
    if (mapp[i][y] == 1) flag2 = true;
  }
  for (int i = y; i >= 0 && !flag3; i--) {
    if (mapp[x][i] == 1) flag3 = true;
  }
  for (int i = x; i <= 2050 && !flag4; i++) {
    if (mapp[x][i] == 1) flag4 = true;
  }
  return flag1 && flag2 && flag3 && flag4;
}
int go[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int maxv = -1;
void bfs() {
  Node node = (Node){0, 0};
  mapp[0][0] = 2;
  queue<Node> que;
  que.push(node);
  int x, y;
  int dx, dy;
  while (!que.empty()) {
    node = que.front();
    que.pop();
    x = node.x;
    y = node.y;
    for (int i = 0; i < 4; i++) {
      dx = x + go[i][0];
      dy = y + go[i][1];
      if (dx < 0 || dy < 0 || dx > maxv || dy > maxv) continue;
      if (mapp[dx][dy] != 0) continue;
      mapp[dx][dy] = 2;
      que.push((Node){dx, dy});
    }
  }
  return;
}
vector<int> vec;
void solve() {
  int n;
  cin >> n;
  int x, y;
  scanf("%d%d", &xx[0], &yy[0]);
  int nn = 2 * n;
  vec.push_back(xx[0]);
  vec.push_back(yy[0]);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &xx[i], &yy[i]);
    vec.push_back(xx[i]);
    vec.push_back(yy[i]);
  }
  sort(vec.begin(), vec.end());
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
  xx[0] = lower_bound(vec.begin(), vec.end(), xx[0]) - vec.begin() + 1;
  yy[0] = lower_bound(vec.begin(), vec.end(), yy[0]) - vec.begin() + 1;
  xx[0] *= 2;
  yy[0] *= 2;
  maxv = max(maxv, xx[0]);
  maxv = max(maxv, yy[0]);
  mapp[xx[0]][yy[0]] = 1;
  for (int i = 1; i <= n; i++) {
    xx[i] = lower_bound(vec.begin(), vec.end(), xx[i]) - vec.begin() + 1;
    yy[i] = lower_bound(vec.begin(), vec.end(), yy[i]) - vec.begin() + 1;
    xx[i] *= 2;
    yy[i] *= 2;
    maxv = max(maxv, xx[i]);
    maxv = max(maxv, yy[i]);
    mapp[xx[i]][yy[i]] = 1;
    fun(xx[i], yy[i], xx[i - 1], yy[i - 1]);
  }
  maxv += 3;
  bfs();
  int res = 0;
  int x1, y1, x2, y2;
  for (int i = 1; i <= n; i++) {
    int temp = res;
    x1 = xx[i];
    y1 = yy[i];
    x2 = xx[i - 1];
    y2 = yy[i - 1];
    if (x1 == x2 && y1 > y2) {
      if (mapp[x1][y1 + 1] != 2) res++;
    } else if (x1 == x2 && y1 < y2) {
      if (mapp[x1][y1 - 1] != 2) res++;
    } else if (y1 == y2 && x1 > x2) {
      if (mapp[x1 + 1][y1] != 2) res++;
    } else if (y1 == y2 && x1 < x2) {
      if (mapp[x1 - 1][y1] != 2) res++;
    }
  }
  cout << res << endl;
}
int main() {
  solve();
  return 0;
}