

Osu!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3784 Accepted Submission(s): 1974 Special Judge Problem Description Osu! is a very popular music game. Basically, it is a game about clicking. Some points will appear on the screen at some time, and you have to click them at a correct time. Now, you want to write an algorithm to estimate how diffecult a game is. To simplify the things, in a game consisting of N points, point i will occur at time t_{i} at place (x_{i}, y_{i}), and you should click it exactly at t_{i} at (x_{i}, y_{i}). That means you should move your cursor from point i to point i+1. This movement is called a jump, and the difficulty of a jump is just the distance between point i and point i+1 divided by the time between t_{i} and t_{i+1}. And the difficulty of a game is simply the difficulty of the most difficult jump in the game. Now, given a description of a game, please calculate its difficulty. Input The first line contains an integer T (T ¡Ü 10), denoting the number of the test cases. For each test case, the first line contains an integer N (2 ¡Ü N ¡Ü 1000) denoting the number of the points in the game. Then N lines follow, the ith line consisting of 3 spaceseparated integers, t_{i}(0 ¡Ü t_{i} < t_{i+1} ¡Ü 10^{6}), x_{i}, and y_{i} (0 ¡Ü x_{i}, y_{i} ¡Ü 10^{6}) as mentioned above. Output For each test case, output the answer in one line. Your answer will be considered correct if and only if its absolute or relative error is less than 1e9. Sample Input
Sample Output
Hint In memory of the best osu! player ever Cookiezi. Source  
