Bicycle Race

At some moment called the initial moment, the cyclists in a road race are at points $x_1, x_2, \ldots, x_n$ meters from the start ($n$ is the number of cyclists). Each cyclist moves at a constant speed of $v_1, v_2, \ldots, v_n$ meters per second. All cyclists move in the same direction.

A reporter covering the race wants to find the moment when the distance between the leading cyclist and the trailing cyclist is minimal, so that a helicopter can photograph all the participants at once.

Given the number of cyclists $n$, their initial positions $x_1, x_2, \ldots, x_n$, and their speeds $v_1, v_2, \ldots, v_n$, write a program that computes the moment $t$ when the distance $l$ between the leading and trailing cyclists is minimal.

The first line contains the integer $n$, the number of cyclists.

The next $n$ lines each contain two integers: $x_i$, the distance from the start to cyclist $i$ at the initial moment ($0 \le x_i \le 10^7$), and $v_i$, the speed of that cyclist ($0 \le v_i \le 10^7$).

Output two real numbers: $t$, the time in seconds from the initial moment until the distance in meters between the leader and the trailing cyclist is minimal, and $l$, that distance.

The numbers $t$ and $l$ must have an absolute or relative error of at most $10^{-6}$. Let the output number be $x$ and the correct answer be $y$. The answer is accepted if $|x - y| / \max\{1, |y|\}$ does not exceed $10^{-6}$.

$2 \le n \le 10^5$.