시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
8 초 (추가 시간 없음) 512 MB 0 0 0 0.000%

문제

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
x1,1 y1,1 x1,2 y1,2
x2,1 y2,1 x2,2 y2,2
...
xn,1 yn,1 xn,2 yn,2

n is the number of lines (1 ≤ n ≤ 100); (xi,1yi,1) and (xi,2yi,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.

예제 입력 1

2
-35 -35 100 100
-49 49 2000 -2000

예제 출력 1

Many

예제 입력 2

4
0 0 0 3
0 0 3 0
0 3 3 3
3 0 3 3

예제 출력 2

1.5000 1.5000

예제 입력 3

4
0 3 -4 6
3 0 6 -4
2 3 6 6
-1 2 -4 6

예제 출력 3

1.0000 1.0000