Minimizing Sphere

You will be given some points in a 3D co-ordinate system. You have to find the minimum volume of the sphere which can enclose all the points.

Input

The first line of the input contains the number of test cases T (0 < T ≤ 20). Each test case begins with an integer N (1 < N ≤ 55). Next N line each contains three integers representing the x, y, z co-ordinates of the points. Absolute value of all co-ordinates lie between 0 and 100.

Output

For each case print the minimum volume of the sphere. Errors less than 10-4 will be ignored.

Sample

Input	Output
2 3 1 2 3 5 -2 3 9 5 -12 2 1 0 0 5 21 -11	2757.47031865 7275.96129172