Airline Hub

World Wide Flyer has landing rights at several airports around the world. They want to place their central hub at one of these airports — the airport that minimizes the maximum direct flying distance from the hub to every other airport.

Treat the Earth as a perfect sphere and take the direct flying distance between two airports to be the great-circle distance (the shortest distance along the surface). Because the sphere's radius is a positive factor common to every distance, the best hub is the airport that minimizes the largest central angle to the other airports, and the choice does not depend on the radius that is used.

The first line contains an integer $n$ ($1 \le n \le 1000$), the number of airports. Each of the next $n$ lines contains two real numbers: the latitude (between $-90$ and $+90$ degrees) and the longitude (between $-180$ and $+180$ degrees) of an airport.

Print a single line with the latitude and longitude of the airport that best serves as the hub, each rounded to exactly two decimal places and separated by a single space. If several airports achieve the minimum possible maximum distance, print the one that appears earliest in the input.