SP13050 AMR12C - Entmoot

“呼，好！早上好，梅里和皮平！”他见到他们时大声说道，“你们可真能睡。我今天已经走了好几百步了。现在我们喝点东西，再去参加恩特会议。” **本翻译由 AI 自动生成**

The first line contains $T$, the number of test cases. The first line of each test case contains $N$, the number of Ents. The next $N$ lines contain three space-separated integers each. The i-th of these lines contains : $x_i$, $y_i$, $s_i$.

Output one line per test case, containing the earliest time when the Ents can meet. Relative and absolute error of $10^{-4}$ are acceptable.

### Constraints: $1 \le T \le 10$ $2 \le N \le 50$ $-1,000,000 \le x_i, y_i \le 1,000,000$ $1 \le s_i \le 1,000,000$ ### Notes/Explanation of Sample In the first test case, all the ents can meet at origin in $1$ unit of time. In the second test case, the first and the third ent reach $(25, 0)$ after $7.5$ units of time, whereas the second ent reaches there after $2.5$ units of time and waits for the remaining ents to arrive. In the third test case, all the ents can meet at origin in $100/15$ units of time.