4 人解决，8 人已尝试。
6 份提交通过，共有 123 份提交。
8.5 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
We understand that reading English is a great pain to many of you. So we’ll keep this problem statememt simple. Write a program that reports the point equally distant from a set of lines given as the input. In case of no solutions or multiple solutions, your program should report as such.
The input is given in the following format:
$n \
x_{1,1} \ y_{1,1} \ x_{1,2} \ y_{1,2} \
\vdots \
x_{n,1} \ y_{n,1} \ x_{n,2} \ y_{n,2}$
$n$ is the number of lines ($1 \le n \le 100$); ($x_{i,1}, y_{i,1}$) and ($x_{i,2}, y_{i,2}$) denote the different points the $i$-th line passes through. The lines do not coincide each other. The coordinates are all integers between $-10000$ and $10000$.
Print a line as follows. If there is exactly one point equally distant from all the given lines, print the $x$ and $y$-coordinates in this order with a single space between them. If there is more than one such point, just print Many (without quotes). If there is none, just print None (without quotes).
The coordinates may be printed with any number of digits after the decimal point, but should be accurate to $10^{-4}$.
3 43 43 6 6 0 6 3 0 -4 0 5 3
2.00000000 2.00000000
4 35 -9 31 24 -20 41 12 32 33 -6 37 27 10 38 -22 29
0.333333333333333 0.7500000000000000
4 30 42 30 -3 -30 34 -30 78 100 -46 82 78 -100 -46 -82 78
Many