You have $$$2n$$$ cards, and a positive integer $$$a_i$$$ is written on the $$$i$$$-th of them. Determine whether there exists a positive integer $$$x$$$ such that the cards can be split into two groups of $$$n$$$ cards each with the following properties:
If so, find any such number.
The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 2 \cdot 10^5$$$): the number of test cases. Then, $$$t$$$ test cases follow.
The first line of a test case contains an integer $$$n$$$ ($$$1 \leq n \leq 2 \cdot 10^5$$$).
The second line contains $$$2n$$$ integers $$$a_1$$$, $$$a_2$$$, $$$\ldots$$$, $$$a_{2n}$$$ ($$$1 \leq a_i \leq 10^9$$$).
It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.
For each test case, print an integer: a suitable value of $$$x$$$. If there are several suitable values, print any of them. If no suitable value of $$$x$$$ exists, print $$$-1$$$.
512 812 328 2 4 121 6 2 3267 67 67 67
4-12-167
In the first test case of the sample, for example, $$$x = 2$$$, $$$x = 4$$$, and $$$x = 8$$$ work.
In the second test case, there is no suitable value of $$$x$$$.