Tom likes to paint sketch. He trys to be good at it. Being a programmer, he would like to systematically learn from masters. He turns those masterpieces into digital data and observes the lines between each other. He wants to calculate the slopes of the lines and gets a slope M which has maximum amount of lines and finds the longest line of the slope M. Tom is eager for improving his skills on sketch and stroke systhesis. Could you do him a favor?
The problem input consists several cases. The first line determines how many cases there will be.
For every case, there will be a number n indicates n straight lines.
The next n lines input will have four positive integers (x1, y1, x2, y2) in order to decide a straight line.(Lines may duplicate.)
(0 < n <= 1000 and -106 <= x1, y1,x2, y2 <= 106)
Print the case number first(see Sample input) and in the next line print the longest line L of the slope with maximum amount of lines. The accuracy of L is rounding to three digits to the right of the decimal point. If there are two or more slopes with the same maximum amount of number lines, choose the slope with maximum value in calculation. Print a blank line after each cases.