Cockroaches
Every midnight, a horror unfolds in the apartment of the scientist Vasya. Thousands of cockroaches emerge from every crevice, swarming towards his dining table to feast on crumbs and leftovers. Vasya despises these cockroaches. After much thought, he has invented a Super-trap that, once activated, attracts all the cockroaches within a large area. He plans to activate the trap tonight. However, there's a challenge: this highly effective trap, with its extensive range, consumes a significant amount of energy. Therefore, Vasya aims to minimize the trap's operating time.
Vasya has gathered information about all the locations where the cockroaches reside. He has observed that the cockroaches only move along the lines of his tablecloth at a constant speed, which we can assume to be 1. This means a cockroach located in one section can move to any adjacent section (either vertically or horizontally) in 1 unit of time. Vasya has decided to activate his trap in one of these sections. Once activated, all the cockroaches will move towards the section containing the trap as quickly as possible. At any given moment after activation, the cockroaches will head towards the section with the trap, minimizing their distance to it. If there are two paths of equal distance, the cockroach may choose either.
Your task is to write a program for Vasya that selects the section that minimizes the time required to eliminate all the cockroaches. Assume the tablecloth is a plane with a Cartesian coordinate system, and the sections are points with integer coordinates.
Input
The first line contains the number of places n (1 ≤ n ≤ 10000) where the cockroaches live. The following n lines contain the x and y coordinates of the places where the cockroaches live (integers not exceeding in absolute value).
Output
You need to output two integers x and y - the coordinates of the section that minimizes the operating time. If there is more than one solution, output any one of them.