M. Three Points
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Cheburashka, Crocodile Gena, and Old Lady Shapoklyak decided to move to the desert. They found three identical houses located at coordinates $$$x_1$$$, $$$y_1$$$, $$$x_2$$$, $$$y_2$$$, $$$x_3$$$, and $$$y_3$$$ respectively. The rat Lariska was assigned the task of calculating the coordinates and digging a straight trench of infinite length for the water supply in such a way as to minimize the total distance from the houses to this trench.

Help her determine the coordinates of two points that lie on this line. The trench may pass under one or more houses.

Input

A single line contains six integers $$$x_1$$$, $$$y_1$$$, $$$x_2$$$, $$$y_2$$$, $$$x_3$$$, and $$$y_3$$$ — the coordinates of the three houses, respectively ($$$-10^9 \le x_1, y_1, x_2, y_2, x_3, y_3 \le 10^9$$$). It is guaranteed that the houses are located at different points.

Output

Output the integer coordinates of two points through which the trench will pass. The points must not coincide. The coordinates must not exceed $$$10^9$$$ in absolute value.

Example
Input
0 0 10 10 5 6
Output
0 0 10 10