2. Point on a Line
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Four points $$$A$$$, $$$B$$$, $$$C$$$ and $$$D$$$ are marked on a plane. No three of them lie on the same line.

A straight line is drawn through points $$$A$$$ and $$$B$$$. Find the coordinates of a point $$$M$$$ on this line such that the length of the polyline $$$CMD$$$ is minimized.

Input

Each of the four input lines contains a pair of integers $$$x_i$$$, $$$y_i$$$, representing the coordinates of points $$$A$$$, $$$B$$$, $$$C$$$, and $$$D$$$, respectively ($$$-1000 \le x_i, y_i \le 1000$$$).

Output

Output two real numbers $$$x_m$$$ and $$$y_m$$$ — the coordinates of point $$$M$$$. The relative or absolute error for each coordinate in your answer must not exceed $$$10^{-3}$$$.

Scoring

Each test case is worth an equal number of points. The maximum score for the problem is 100.

Example
Input
2 1
-3 -1
1 2
-3 3
Output
0.678160951 0.471264380
Note

In Python, you can read two space-separated integers as follows: x, y = map(int, input().split())