2017 Asia HCMC Vietnam National Programming Contest

#### Start

2017-11-04 17:00 AKDT

## 2017 Asia HCMC Vietnam National Programming Contest

#### End

2017-11-04 22:00 AKDT
The end is near!
Contest is over.
Not yet started.
Contest is starting in -1413 days 15:15:07

5:00:00

0:00:00

# Problem KKeep the Parade Safe

The 1941 October Revolution Parade of November $7^{th}$, 1941, taking place in Moscow, Soviet Union, was a parade in honor of the October Revolution 24 years ealier. It was one of the most memorable parade because of the serious circumstance at that time: Soviet’s forces had constantly been dominated since the last 4 months, and Moscow was surrounded by Nazi under an extremely high pressure. Many soldiers joined that parade, and immediately rushed into the battle field after then. The winning against Nazi later pushed Hitler’s forces very far away from Moscow and completely destroyed his Barbarossa plan…

In order to ensure safety for the parade, Stalin gathered information about the positions of Nazi’s troops. He knew that Nazi’s troops can be depicted as $N$ points on the Cartesian plane. He was also aware of $S$ Soviet’s defending castles, which can be represented by $S$ points.

Stalin thought that one castle was in danger, if there exist a group of four Nazi’s troops, which forms a non-degenerate quadrilateral and the castle lies inside or on its border. Recall that a quadrilateral is non-degenerate iff no three of its vertices are collinear, and its edges do not intersect (with the exception that edges can intersect at vertices). Stalin wanted to know how many castles were in danger, so that he can send a suitable protection for them.

## Input

• The first line of the input contains one integer $N$ $(4 \leq N \leq 1\, 000)$ - the number of Nazi’s tropps.

• Each of the next $N$ lines contains two integers $x$ and $y$ $(0 \leq x, y \leq 10^6)$ representing one point where a Nazi’s troop took place.

• The next line contains one integer $S$ $(1 \leq S \leq 1\, 000)$ - the number of Soviet castles.

• Each of the next $S$ lines contains two integers $x$ and $y$ $(0 \leq x, y \leq 10^6)$ representing position of one castle.

It is guaranteed that all given points are distinct.

## Output

Write in one line the number castles which were in danger.

## Sample Clarification

The $1^{st}$ sample corresponds to the following figure. Blue points represent Nazi troops’ locations, oranges points represent in-danger castles, green points represent non in-danger castles.

The $2^{nd}$ sample corresponds to the following figure. Note that the quadrilateral is degenerated, so no castle is in danger.

Sample Input 1 Sample Output 1
4
0 1
3 7
4 5
6 5
9
1 4
1 6
2 3
2 5
3 5
3 6
4 8
5 4
6 3

4

Sample Input 2 Sample Output 2
4
1 2
3 2
5 2
2 5
2
3 4
2 3

0