Although Tianyi has buried most of evidence, there's still some evidence left. It distributes scattered.
Tianyi wants to find a big round paper to cover the evidence. In line with the principle of not wasting, Tianyi decide to make the paper as possible as small.

This problem contains several cases. Input until 0.
The first line of each case is an integer N(0 < N < 500), indicates the number of evidence.
Then N lines will be followed. Each line contains a coordinate x and y.

For each case, you should output the coordinate of the centre of the paper and it's minimum radius. All output numbers are rounded to the second digit after the decimal point.