C. Dhrumil The Pados Wali Aunty
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Dhrumil was once very bored because he was missing the choas and fight. Yeah, he doesn't like when everything is going well :)

To spice things up he decided to spark a debate between his friends based on Which is better. Is it Marvel? or Is it DC?

So he brought his $$$2n$$$ friends, the $$$i$$$-th member has fighting level $$$a_i$$$. He then assigned each of his friend to one of the two Teams (Marvel or DC). Remember each team can only have odd number of members. The number of members in the 2 Teams may be equal or different. Every member has to be assigned to exactly one class.

Let's define fighting level of a Team as the median of fighting levels of the members in the team.

Reminder: median

To make things more fun he want's to minimize the absolute difference between the fighting levels of the 2 Teams (Better script writer than Jay Shah......)

You as Dhrumil, have to find among such partitions, What is the minimum possible absolute difference you can achieve between fighting levels of two teams of odd sizes?

Input

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 10^5$$$) — the number of members/2.

The second line of each test case contains $$$2n$$$ integers $$$a_1, a_2, \dots, a_{2 n}$$$ ($$$1 \le a_i \le 10^9$$$) — fighting levels of members.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^5$$$.

Output

For each test case, output a single integer, the minimum possible absolute difference between fighting levels of two teams of odd sizes.

Example
Input
3
4
2 5 8 1 10 10 5 2
4
8 2 4 10 5 6 9 10
4
1 5 9 8 8 8 6 5
Output
0
2
2