An artist who wanted to create an installation where his works appeared to be floating in midair has cast a large cube of clear acrylic to serve as a base. Unfortunately, during the casting, some small flecks of dirt got into the mix, and now appear as a cluster of pinpoint flaws in the otherwise clear cube.

He wants to drill out the portion of the cube containing the flaws so that he can plug the removed volume with new, clear acrylic. He would prefer to do this in one drilling step. For stability’s sake, the drill must enter the cube only once, perpendicular to one of its faces. The cube’s faces are parallel to the coordinate axes.

Given the $(x,y,z)$ positions of the flaws, and treating the size of the flaws as negligible, what is the smallest diameter drill bit that can be used to remove the flaws in one operation??

-----Input-----
The first line of input contains an integer $N$ denoting the number of flaws. $3 \leq N \leq 5000$

This is followed by $N$ lines of input, each containing three real numbers in the range $-1000.0\ldots 1000.0$, denoting the $(x,y,z)$ coordinates of a single flaw. Each number contains at most $6$ digits following a decimal point. The decimal point may be omitted if all succeeding digits are zero.

-----Output-----
Print the diameter of the smallest drill bit that would remove all the flaws.

The answer is considered correct if the absolute or relative error is less than $10^{-4}$

-----Examples-----
Sample Input 1:
3
1.0 0.0 1.4
-1.0 0.0 -1.4
0.0 1.0 -0.2
Sample Output 1:
2.0000000000

Sample Input 2:
5
1.4 1.0 0.0
-0.4 -1.0 0.0
-0.1 -0.25 -0.5
-1.2 0.0 0.9
0.2 0.5 0.5
Sample Output 2:
2.0000000000

Difficulty: competition

Starter code:

Solutions: