**3 人解决**，7 人已尝试。

**5 份提交通过**，共有 79 份提交。

**8.9** 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:

is the number of lines (); () and () denote the different points the -th line passes through. The lines do not coincide each other. The coordinates are all integers between and .

Print a line as follows. If there is exactly one point equally distant from all the given lines, print the and -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 .

Input

3 43 43 6 6 0 6 3 0 -4 0 5 3

Output

2.00000000 2.00000000

Input

4 35 -9 31 24 -20 41 12 32 33 -6 37 27 10 38 -22 29

Output

0.333333333333333 0.7500000000000000

Input

4 30 42 30 -3 -30 34 -30 78 100 -46 82 78 -100 -46 -82 78

Output

Many