Problem F
Treehouse

Xingjian is going to build a treehouse in a large field with $n$ trees, no three of which are collinear. The plan is to use three trees as the corners of the house, so the house will be triangular, but since he doesn’t want to have to cut down any trees or any branches, it’s very important that there are no other trees in the triangle formed but the chosen trees. Help Xingjian choose three trees, such that the triangle formed by these trees doesn’t have any other trees in it!

Input

In the first line there is an integer $3 \leq n \leq 10^5$.

Then follow $n$ lines, each containing two integers $0 \leq x \leq 10^9$ and $0 \leq y \leq 10^9$, indicating the position of the $i^{th}$ tree. It’s guaranteed that no three trees are collinear. Also there is at most one tree in a point.

Output

Output three lines, each containing two integers $x$ and $y$, indicating the position of a tree which Xingjian should use for his treehouse. If there are multiple solutions you can output any of them.

4
0 0
0 5
5 0
1 2

0 0
0 5
1 2