Helipad

There are N inhabited islands in the sea. Building a hospital on every island would be too expensive, so one hospital and helipad will be built at a single location. The location may be on an island or anywhere over the sea.

To transport emergency patients as quickly as possible, choose the location so that the largest straight-line distance from the helipad to any island is as small as possible. Write a program that finds such a helipad location and the distance from it to the farthest island.

Ignore the size of each island and treat every island as a point on a two-dimensional plane.

The first line contains an integer N, the number of islands. (2 ≤ N ≤ 1,000)

Each of the next N lines contains two integers, the x-coordinate and y-coordinate of one island. Every coordinate is between -30,000 and 30,000, inclusive.

On the first line, print the x-coordinate and y-coordinate of the helipad in that order.

On the second line, print the distance from the helipad to the farthest island.

Each coordinate and the distance must be rounded to three digits after the decimal point.