Pea-City

The Pea King was a wise ruler and a good strategist. He spent all his time dealing with state affairs. As the kingdom grew, the population increased, and new houses popped up everywhere like mushrooms after the rain. The kings of neighboring states grew envious and began planning a war.

To protect the capital from the invaders, the Pea King decided to build a new city wall around the capital's borders that would enclose all the buildings on the city outskirts as well.

For the aesthetic effect, namely to make the map on the wall in the king's parlor look pretty, it was decided that the capital city should have rectangular borders. Keeping this in mind, the total land area should remain as small as possible, and all $N$ houses registered should stay inside the borders of the rectangular city.

The first line contains a single integer $N$, the number of houses in the city ($3 \le N \le 80\,000$). The following $N$ lines each contain a pair of integers $X$, $Y$, the Cartesian coordinates of a house ($-25\,000 \le X, Y \le 25\,000$). It is guaranteed that at least three houses are not on one line.

Output the coordinates of the four corners of the rectangle in counterclockwise order, one pair of coordinates per line. The answer is considered correct if the absolute or relative error of the rectangle's area does not exceed $10^{-5}$, and all houses are strictly inside the city or at a distance of at most $10^{-5}$ from its borders.