You are the proud owner of an infinitely large grid of lightbulbs, represented by a Cartesian coordinate system . Initially, all of the lightbulbs are turned off, except for one lightbulb, where you buried your proudest treasure. In order to hide your treasure's position, you perform the following operation an arbitrary number of times (possibly zero): Choose two integer numbers (x) and (y), and switch the state of the (4) lightbulbs at ((x, y)), ((x, y + 1)), ((x + 1, y - 1)), and ((x + 1, y)). In other words, for each lightbulb, turn it on if it was off, and turn it off if it was on. Note that there are no constraints on (x) and (y). In the end, there are (n) lightbulbs turned on at coordinates ((x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)). Unfortunately, you have already forgotten where you buried your treasure, so now you have to figure out one possible position of the treasure. Good luck! Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((1 \le n \le 2 \cdot 10^5)) — the number of lightbulbs that are on. The (i)-th of the next (n) lines contains two integers (x_i) and (y_i) ((\color{red}{-10^8} \le x_i, y_i \le \color{red}{10^8})) — the coordinates of the (i)-th lightbulb. It is guaranteed that all coordinates are distinct. Additional constraint : There exists at least one position ((s, t)) ((\color{red}{-10^9} \le s, t \le \color{red}{10^9})), such that if the lightbulb at position ((s, t)) is initially turned on, then after performing an arbitrary number of operations (possibly zero), we will get the given configuration of lightbulbs. It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output two integers (s) and $$$t$$