3410 -- Split convex polygon

Language:

Split convex polygon

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 685		Accepted: 198

Description

Two polygons on a plane are described by the coordinates of their vertices in anticlockwise order. The polygons are otherwise arbitrary but it is known that no three sequential vertices lie on the same line. It is suspected that the two polygons are parts of one bigger convex polygon that was split in two.

Write a program to check the guess on the condition that it is allowed to move and rotate, but not to invert the parts to match them together. All computations should be made with the precision of 0.001.

Input

The first line contains an integer N₁ (3≤N₁≤100) – the number of vertices of the first polygon. Each of the following N₁ lines contains two real numbers X, Y separated by one space – the coordinates of one vertex. The rest of the file describes the second polygon in similar manner.

Output

The first and only line of the output must contain the number 1 if the guess is correct, and 0 otherwise.

Sample Input

Sample Output

Source

Northeastern Europe 2002, Western Subregion