Write a program to find a circle that covers a given set of points with the minimal possible area. Each test case contains at most points.
The input consists of several test cases. Each test case begins with an integer , the number of points. The next lines each contain two numbers representing the and coordinates of a point, separated by a space. The end of input is marked by a line containing a single .
For each test case, output one line with the and coordinates of the center and the radius of the minimal covering circle, separated by spaces. Print all values with exactly digits after the decimal point.
Example 1