People with headphones P55080

Professor Oak is a hater. His new rage is against the people that wear headphones while walking on the street. They seem to move on straight lines no matter what, never caring about people around. Prof. Oak has a radical idea of what should be done: to capture all those headphone people and intern them in a bedlam for some psychiatric treatment.

Let us model this situation: We have $n$ points on the two-dimensional plane. Every point moves forever with some constant speed. Two or more points can be at the same position at the same time (that is, there are no collisions). Prof. Oak can decide when to capture all the points. He will do that with the smallest circular net that covers all the points.

Can you compute the minimum possible radius of the net if we choose the best moment in time (past, present, or future)?

Input

Input consists of several cases, each with the number of points $n$, followed by four real numbers $x_i$, $y_i$, $a_i$ and $b_i$ to define every point, by its position $(x_i, y_i)$ at time 0, and its constant speed $(a_i, b_i)$. Assume $2 \le n \le 1000$, and that the four numbers defining each point have absolute values bounded by 1000 and at most two decimal digits.

Output

For every case, print with one digit after the decimal point the minimum radius to capture all the points if we optimally choose when to do it. The input cases have no precision issues.