当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
Xed has a great interest in Global Positioning System. To simulate it, he constructs a Cartesian coordinate system in a infinite plane whose one unit equals 1 kilometer. Then Xed puts three sensors on three different points (x1,y1), (x2,y2), (x3,y3) and a signal generator in the plane.
All three sensors are linked to a timer. Once a sensor has received the signal it will immediately trigger the timer which records the time. The timer starts to count when it first receives a trigger and records the earliest time when the sensors receive a signal.
Now you are given:
Please help Xed to determine the position of the signal generator. It is guaranteed that such point always exists and is unique.
The input consists of several test cases. Each test case has the following format:
C
x1 y1 x2 y2 x3 y3
t1 t2 t3
The input is terminated by C = 0
For each test case, print the case number on the first line and the position of the generator (x, y) on the second line. x and y should be separated by a single space and should be rounded to six digits to the right of the decimal point. See the sample output below for more details.
1000 0 0 1 0 2 1 0 0.414213562373 1 1000 0 1 1 1 2 1 0 0.6 1.6 1000 0 0 0 1 1 0 0.4142135 0 0 1000 0 0 0 -1 0 1 0 0 1 1000 0 0 0 1 0 -1 0 1 0 1000 0 0 1 0 -1 0 0 1 0 1000 0 0 -1 0 1 0 0 0 1 100 0 0 0 1 1 0 0 10 10 0
Case 1: 0.000000 1.000000 Case 2: 0.200000 1.000000 Case 3: 1.000000 1.000000 Case 4: 0.000000 -0.500000 Case 5: 0.000000 -0.500000 Case 6: -0.500000 0.000000 Case 7: -0.500000 0.000000 Case 8: 0.000000 0.000000
| 时间上限 | 内存上限 |
| 1000 | 65536 |