F. Framed Photo
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

At the end of the big Unioeste Programming Marathon, euphoria took over the room. To capture the iconic moment, all the competitors threw their badges in the air in celebration. João, the event's Social Media Wizard, captured a spectacular photo of that moment.

Now, João needs to post this photo on Instagram, but the original image is too wide, full of empty spaces that diminish the visual impact. He wants to make a rectangular cut aligned with the axes that perfectly frames all the badges. To create a visually powerful and minimalist composition, he needs this frame to be the smallest rectangle possible that still contains all the badges.

Being a perfectionist, but also... "computationally efficient" (not to say lazy), João decided to turn his task into one last challenge. He used software to identify the coordinates of the center of each badge in the photo. Now, he asks for your help, as one of the brilliant coders, to create a program that determines the exact coordinates of the four corners of the "perfect frame."

Input

The first line of input will contain an integer $$$N$$$ ($$$1 \le N \le 10^{6}$$$), the number of badges in the photo. The next $$$N$$$ lines will contain two integers each, $$$x_i$$$ $$$y_i$$$ ($$$-10000 \le x_i, y_i \le 10000$$$), the coordinates of each badge in the photo.

Output

Your program should print four lines. Each line should contain the $$$x$$$ and $$$y$$$ coordinates of one of the vertices of the smallest rectangle, separated by a space. The vertices can be printed in any order.

Examples
Input
5
4 5
-1 2
8 -3
2 9
-4 0
Output
-4 -3
8 -3
8 9
-4 9
Input
4
-3 5
10 5
0 5
10 5
Output
-3 5
10 5
10 5
-3 5