Minieye is developing a detector placed in a car to sensor surroundings It can calculate the sum of distances between a center to near targets. To make problem easily, you just need to write a program to compute a minimum sum of Euclid distance between the center and 12 near targets of surroundings.

Given N points, you should output the minimum sum of distance between the center and 12 targets of them. The center can be placed anywhere you want.

The first line of the input file contains an integer T (T <= 10) specifying the number of test cases.

Each test case begins with a line containing an integer N (12 <= N <= 1000),The following N lines each contain two floating numbers x, y (-200 < x, y < 200).

For each test case, output a single line containing best score accurate to 0.0001 (Each coordinate keep 4 digits after decimal point)

1
20
-53.30 -81.00
74.10 69.70
76.10 -27.20
-38.30 -85.00
-28.00 -48.80
-9.70 -7.40
25.60 80.00
-18.70 39.30
29.70 -82.90
-76.50 -42.30
-91.70 63.30
-22.10 -96.90
27.50 -50.40
28.70 -52.20
-58.40 97.20
-82.80 35.20
87.90 47.40
26.20 -10.30
50.80 -57.50
91.60 92.90

586.4279