CF930D.Game with Tokens

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The first line contains a single integer $n$ ( $1<=n<=10^{5}$ ) — the number of black points.

The ( $i+1$ )-th line contains two integers $x_{i}$ , $y_{i}$ ( $-10^{5}<=x_{i},y_{i},<=10^{5}$ ) — the coordinates of the point where the $i$ -th black token is initially located.

It is guaranteed that initial positions of black tokens are distinct.

输入格式

Print the number of points where the white token can be located initially, such that if both players play optimally, the black player wins.

输出格式

In the first and second examples initial positions of black tokens are shown with black points, possible positions of the white token (such that the black player wins) are shown with white points.

The first example:

The second example:

In the third example the white tokens should be located in the inner square $2×2$ , to make the black player win.

输入输出样例

输入#1
```
4
-2 -1
0 1
0 -3
2 -1
```
输出#1
```
4
```
输入#2
```
4
-2 0
-1 1
0 -2
1 -1
```
输出#2
```
2
```

输入#3

输出#3

说明/提示

In the first and second examples initial positions of black tokens are shown with black points, possible positions of the white token (such that the black player wins) are shown with white points.

The first example:

The second example:

In the third example the white tokens should be located in the inner square $2×2$ , to make the black player win.

首页