Problem: The 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 Ci described by a center (xi, yi) and a radius ri. No two ranges' borders have more than one common point, that is for every pair (i, j) (1 ≤ i < j ≤ n) either ranges Ci and Cj 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.

<image>

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.

<image>

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 xi, yi and ri ( - 106 ≤ xi, yi ≤ 106, 1 ≤ ri ≤ 106), describing a circular movement range centered at (xi, yi) with radius ri.

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 <image>.

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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int N;
long long X[1000], Y[1000], R[1000];
vector<int> g[1001];
long long dp[1001][2][2];
long long dfs(int idx, bool sum1, bool sum2) {
  if (~dp[idx][sum1][sum2]) return (dp[idx][sum1][sum2]);
  long long latte = 0, malta = 0;
  latte += ((R[idx]) * (R[idx])) * (sum1 ? 1 : -1);
  malta += ((R[idx]) * (R[idx])) * (sum2 ? 1 : -1);
  for (auto &to : g[idx]) {
    latte += dfs(to, sum1 ^ 1, sum2);
    malta += dfs(to, sum1, sum2 ^ 1);
  }
  return (dp[idx][sum1][sum2] = max(latte, malta));
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> X[i] >> Y[i] >> R[i];
  }
  for (int i = 0; i < N; i++) {
    long long dist = INF, connect = 1000;
    for (int j = 0; j < N; j++) {
      if (i == j) continue;
      if (R[i] >= R[j]) continue;
      const long long beet =
          ((X[i] - X[j]) * (X[i] - X[j])) + ((Y[i] - Y[j]) * (Y[i] - Y[j]));
      if (beet <= R[j] * R[j] && dist > R[j]) {
        dist = R[j];
        connect = j;
      }
    }
    g[connect].push_back(i);
  }
  memset(dp, -1, sizeof(dp));
  long long ret = 0;
  for (auto &to : g[1000]) ret += dfs(to, 1, 1);
  cout << fixed << setprecision(12) << ret * acos(-1) << endl;
}