Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. An overnight dance in discotheque

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won't hurt, will it?

The discotheque can be seen as an infinite *xy*-plane, in which there are a total of *n* dancers. Once someone starts moving around, they will move only inside their own movement range, which is a circular area *C*_{i} described by a center (*x*_{i}, *y*_{i}) and a radius *r*_{i}. No two ranges' borders have more than one common point, that is for every pair (*i*, *j*) (1 ≤ *i* < *j* ≤ *n*) either ranges *C*_{i} and *C*_{j} are disjoint, or one of them is a subset of the other. Note that it's possible that two ranges' borders share a single common point, but no two dancers have exactly the same ranges.

Tsukihi, being one of them, defines the spaciousness to be the area covered by an odd number of movement ranges of dancers who are moving. An example is shown below, with shaded regions representing the spaciousness if everyone moves at the same time.

But no one keeps moving for the whole night after all, so the whole night's time is divided into two halves — before midnight and after midnight. Every dancer moves around in one half, while sitting down with friends in the other. The spaciousness of two halves are calculated separately and their sum should, of course, be as large as possible. The following figure shows an optimal solution to the example above.

By different plans of who dances in the first half and who does in the other, different sums of spaciousness over two halves are achieved. You are to find the largest achievable value of this sum.

Input

The first line of input contains a positive integer *n* (1 ≤ *n* ≤ 1 000) — the number of dancers.

The following *n* lines each describes a dancer: the *i*-th line among them contains three space-separated integers *x*_{i}, *y*_{i} and *r*_{i} ( - 10^{6} ≤ *x*_{i}, *y*_{i} ≤ 10^{6}, 1 ≤ *r*_{i} ≤ 10^{6}), describing a circular movement range centered at (*x*_{i}, *y*_{i}) with radius *r*_{i}.

Output

Output one decimal number — the largest achievable sum of spaciousness over two halves of the night.

The output is considered correct if it has a relative or absolute error of at most 10^{ - 9}. Formally, let your answer be *a*, and the jury's answer be *b*. Your answer is considered correct if .

Examples

Input

5

2 1 6

0 4 1

2 -1 3

1 -2 1

4 -1 1

Output

138.23007676

Input

8

0 0 1

0 0 2

0 0 3

0 0 4

0 0 5

0 0 6

0 0 7

0 0 8

Output

289.02652413

Note

The first sample corresponds to the illustrations in the legend.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/21/2022 17:45:05 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|