JMU F18 Week 12

Start

2018-11-16 20:30 CET

JMU F18 Week 12

End

2018-11-23 20:30 CET
The end is near!
Contest is over.
Not yet started.
Contest is starting in -391 days 17:04:37

Time elapsed

168:00:00

Time remaining

0:00:00

Problem O
Robot Protection

You are developing a new robotic guard that can wander around and look for suspicious activity in your home. The robot is small and not smart enough to maneuver by itself. Instead, you set up fixed-location beacons in the region you want it to protect. The robot is programmed to walk toward a single beacon, any beacon, in a straight line. When it reaches a beacon, it turns and walks towards another beacon, chosen at random. It can also stop and change course at any time, not just when it reaches a beacon. It does this all day long, relaying surveillance information to a master computer. In this way, it covers a lot of ground.

Given a configuration of beacons, your job is to determine the area that the robot can patrol. You should assume that the robot starts at the first beacon of the configuration.

Input

Input consists of up to $30$ configurations of beacons. Each configuration starts with a line containing the number of beacons, $1 \le n \le 10\, 000$. The next $n$ lines each describe one beacon with two integers $x~ y$, where both are in the range $[-10\, 000,10\, 000]$. Input ends when $n$ is $0$.

Output

For each configuration of beacons, output the area the robot has to patrol. Your answer should be accurate to within $0.1$ square units.

Sample Input 1 Sample Output 1
5
0 0
10 10
0 10
10 0
5 5
10
6 39
28 25
28 13
31 3
11 19
31 17
26 19
18 13
30 11
25 20
0
100.0
406.0