HZNUOJ

A MST Problem

Tags:
Time Limit:  1 s      Memory Limit:   32 MB
Submission:41     AC:20     Score:98.86

Description

It is just a mining spanning tree ( 最小生成树 ) problem, what makes you a little difficult is that you are in a 3D space.

Input

The first line of the input contains the number of test cases in the file. And the first line of each case contains one integer numbers (0<n<30) specifying the number of the point . The next n lines, each line contains Three Integer Numbers xi, yi and zi, indicating the position of point i.

Output

For each test case, output a line with the answer, which should accurately rounded to two decimals .

Samples

input
2 2 1 1 0 2 2 0 3 1 2 3 0 0 0 1 1 1
output
1.41 3.97

Source

20100831湖工大校赛