Two Cakes

SUAPC 2023 Summer problem setters were to be fed $NMK$ two-dimensional cakes delivered to room Gong A527 at Yonsei University. The setters were so hungry from writing problems that they ate all of them except two special cakes.

Sinchon ICPC and Morgorithm, who arrived late, avoided the setters' anger by offering them two unopened cake boxes. Looking at the cakes, they got an idea for a new problem: both cakes are rectangles. They proved that a single straight cut can split each cake into two pieces of equal area. The setters, now out of sugar, left it to the contest team to find where this cut should go.

Before the two of them finish eating the cakes, find a cut that splits each of the two cakes into two pieces of equal area.

The first line to the fourth line each contain the x and y coordinates $x_{1,i}, y_{1,i}$ of a vertex of the first cake, separated by a space. $(1 \le i \le 4;$ $-100\,000 \le x_{1,i}, y_{1,i} \le 100\,000)$

The fifth line to the eighth line each contain the x and y coordinates $x_{2,i}, y_{2,i}$ of a vertex of the second cake, separated by a space. $(1 \le i \le 4;$ $-100\,000 \le x_{2,i}, y_{2,i} \le 100\,000)$

Each cake is always a non-empty rectangle, and the vertices of each cake are given in random order. The two cakes never meet at a single point, and no valid cut is parallel to the y-axis.

If the cut is part of a straight line $y=px+q$, print $p$ and $q$ on the first line, separated by a space. If there are multiple answers, print any of them.

If $p$ or $q$ is an integer, print it as is. If it is not an integer, and the number to print is $\frac{a}{b}$, print $a$ and $b$ separated by '/'. $(a, b$ are integers, $b>0$, $\gcd(a,b)=1)$

The calculation and output may exceed the range of 32-bit integers.