Balloon

Time Limit: 3 Seconds
Memory Limit: 65536 KB
Special Judge

The weather is wonderful today. *Gao* takes a walk in the garden with
his girlfriend. His girlfriend likes balloons so much, so that she wants to fly some balloons (not kites!) in the garden.

We can regard the garden as a three-dimensional space, and its coordinate starts from (0,0,0) to (10000,10000,10000). There are `N` groups of balloons, each of groups has a red balloon and a blue balloon. We can regard each balloon as a sphere, all the radius of spheres are `R`. The center of each sphere will be given in the input.

For some reasons, she wants to choose one balloon (red one or blue one) from
**each** group, so that she can put exactly `N` balloons
in the garden. It's obvious that there is no overlap for any two balloons in
the `N` balloons which she selected. The largest `R` will make *Gao*'s girlfriend happiest. Can you help *Gao* to calculate the largest R?

#### Input

There are multiple cases. For each case, The first line contains an integer
`N` (2 ≤ `N` ≤ 200), meaning there are `N`
groups of balloons. In the next `N` lines, each line contains six
integers, indicating the coordinates of two balloons.

NOTICE: The garden only limits the center of the balloon.

#### Output

For each test case, it contains one real number indicating the largest
`R`. The results should be rounded to three decimal places.
You should promise that there is still no overlap for any two balloons after rounded.

#### Sample Input

2
1 1 1 5 5 5
1 1 1 5 5 5

#### Sample Output

3.464

Author:

**REN, Qing**
Submit
Status