This is an interactive problem. The RiOI team is hosting a robot championship! This time, your robot is teleported into an infinite 2D plane with the Cartesian coordinate system on it. There are (n) anchor points on the plane, and the coordinates of the (i)-th anchor point are ((x_i, y_i)) ((-10^9\le x_i,y_i\le 10^9)). These are given to your robot by the jury as soon as it is teleported into the plane. However, your robot doesn't know its initial coordinates at first. To test the IQ of your robot, the RiOI team has come up with an interesting game. Your robot needs to find out the initial coordinates ((X, Y)) ((-10^9\le X, Y\le 10^9)) by making the following moves. In one move, assuming that its current coordinates are ((a,b)), your robot can choose a non-negative integer (k) ((0\le k\le 10^9)) and do one of the following four types of operations: Move up by (k) units, i.e., your robot will move to ((a,b+k)); Move down by (k) units, i.e., your robot will move to ((a,b-k)); Move left by (k) units, i.e., your robot will move to ((a-k,b)); Move right by (k) units, i.e., your robot will move to ((a+k,b)). After each move, the jury will give the minimum Manhattan Distance between the current coordinates of your robot and any anchor point. More formally, assuming that the coordinates of your robot are ((c,d)) after the move, the jury will output () \min_{1\le i\le n}\left ( \left|x_i-c\right|+\left|y_i-d\right|\right ). () To win the prize, you must prove that your robot has a high IQ. So you have to write a program for your robot to find its initial coordinates ((X, Y)) in no more than (10) moves. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 100)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((1\le n\le 100)) — the number of anchor poin