시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
3 초 512 MB 0 0 0 0.000%

## 문제

Grid City is growing rapidly. The city council has decided to establish two separate administrative parts: one for downtown and one for the outskirts. They have fixed the boundary, which has the shape of a convex polygon.

A glance at the map reveals that the city is made up of blocks separated by a grid of north-south avenues and east-west streets. A block is the area enclosed between two adjacent streets and two adjacent avenues. Streets and avenues are equally spaced, so all blocks have the same square shape. You can ignore the width of streets and avenues. A block belongs to downtown if it lies entirely within the boundary polygon (the block may touch the boundary). If part of the block (or the whole block) lies outside of the boundary polygon, the entire block belongs to the outskirts.

There is a street running from one of the westernmost vertices of the boundary polygon to one of its easternmost vertices.

Your have to determine the number of blocks in downtown.

## 입력

The first line contains an integer n (3 ≤ n ≤ 100 000), which is the number of vertices of the boundary polygon.

The next n lines describe the vertices of the boundary polygon. Each of these lines contains two integers x (1 ≤ x ≤ 109) and y (1 ≤ y ≤ 109). The vertex is on the intersection of avenue x and street y.

All vertices are unique and are not all collinear.

## 출력

Display the number of blocks in downtown.

## 예제 입력 1

4
10 10
50 30
10 30
50 10


## 예제 출력 1

800


## 예제 입력 2

5
10 30
20 50
30 10
40 40
50 30


## 예제 출력 2

805