# Star Wars

Near the planet Mars, in a faraway galaxy eerily similar to our own, there is a fight to the death between the imperial forces and the rebels. The rebel army has $N$ ships which we will consider as points $(x_{i}, y_{i}, z_{i})$. Each ship has a receiver with power $p_{i}$. The rebel army needs to be able to send messages from the central cruiser to all the ships, but they are tight on finances, so they cannot afford a strong transmitter.

If the cruiser is placed at $(x, y, z)$, and one of the other ships is at $(x_{i}, y_{i}, z_{i})$ and has a receiver of power $p_{i}$, then the power of the cruiser’s transmitter needs to be at least

\[ (|x_{i} - x| + |y_{i} - y| + |z_{i} - z|) / p_{i} \]Your task is to find the position for the cruiser that minimizes the power required for its transmitter, and to output that power.

### Input

The first line of input gives the number of cases, $T, 1 \le T \le 10$. $T$ test cases follow.

Each test case contains on the first line the integer $N, 1 \le N \le 1000$, the number of ships in the test case.

$N$ lines follow, each line containing four integer numbers $x_ i, y_ i, z_ i$ and $p_ i$, separated by single spaces. These are the coordinates of the $i$-th ship, and the power of its receiver. There may be more than one ship at the same coordinates.

You may assume that $0 \leq x_ i, y_ i, z_ i \leq 10^6, 1 \leq p_ i \leq 10^6$.

### Output

For each input case, you should output: “Case #$X$: $Y$”, where $X$ is the number of the test case and $Y$ is the minimal power that is enough to reach all the fleet’s ships. Answers with a relative or absolute error of at most $10^{-6}$ will be considered correct.

Sample Input 1 | Sample Output 1 |
---|---|

3 4 0 0 0 1 1 2 0 1 3 4 0 1 2 1 0 1 1 1 1 1 1 3 1 0 0 1 2 1 1 4 3 2 3 2 |
Case #1: 3.500000000 Case #2: 0.000000000 Case #3: 2.333333333 |