Airline Hub

Time Limit: 1000ms
Memory Limit: 65536KB
This problem will be judged on PKU. Original ID: 2587
64-bit integer IO format: %lld      Java class name: Main

Description

World Wide Flyer has landing rights at several airports throughout the world. They wish to place their central hub at the airport that minimizes the maximum direct flying distance from the hub to any other airport in the world.

Input

Input consists of a line containing n <= 1000, the number of airports. n lines follow, each giving the latitude (between -90 and +90 degrees) and longitude (between -180 and +180 degrees) of an airport.

Output

To two decimal places, give the latitude and longitude of the airport that best serves as a hub. If there are several any one will do.

Sample Input

3
3.2 -15.0
20.1 -175
-30.2 10

Sample Output

3.20 -15.00

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .