Problem Description
When Jgshining is a baby, he already showed his high intelligence. For example ,when somebody asked him“Who do you love, Dad? Mom?”,He always answered:“Both!”.When he stayed together with Mom, Dad and brother, he always selects a position from where it is the same distance to all three people. Now, you are given the positions of dad, mom and brother, please print the point where Jgshining will select?
If there is no this kind of position, please output “No this position”, otherwise, you should print this point.
Input
Input contains an integer N in the first line, which indicates the number of test data. And then N lines follow. Each line consists of three pairs of numbers xi and yi, separated by a space.
Output
For each test data you should output the point where Jgshining will select,please output the point which has minimal distance from three people if more than one point satisfy the question. One line per case.
Sample Input
2
0 0 1 0 0 1
0 0 1 0 2 0
Sample Output
0.5 0.5
No this position
