Problem: Valentine week has started and Chotu wants to impress his crush. On this rose day Chotu plans to give his crush a bouquet of roses. Chotu visits a rose shop which has N number of roses and each rose has a certain love factor. Now Chotu wants to make a bouquet with maximum number of roses. As Chotu’s crush is very selective, she will only accept the bouquet if it contains roses with distinct love factors. To make the bouquet attractive Chotu wants to arrange roses in the following order. He will first choose rose with the largest love factor followed by the rose with smallest love factor followed by rose with 2^nd largest love factor followed by the rose with 2^nd smallest love factor and so on.

Help Chotu to design the bouquet.

Input

First line contains integer T denoting number of testcases.

Second line contains integer N denoting number of roses.

Next line contains N integers separated by a single space denoting love factor.

Ouptut

For each test case print answer in single line in the format explained above.

Constraints

1 ≤ T ≤ 10

1 ≤ N ≤ 10^5

1 ≤ Love factor of roses ≤ 10^6

SAMPLE INPUT
2
6
6 2 1 3 2 1
3
1 1 1

SAMPLE OUTPUT
6 1 3 2
1

Explanation

In first test case, the distinct roses available are 6 2 1 3. So chotu will make bouquet in following order : 6 1 3 2

In second test case there is only one distinct rose with love factor 1. So he can form a bouquet with only one rose.

Solution (in PYTHON):

Solution:
t = int(raw_input())
for i in range(t):
    s = int(input())
    num1 = set(map(int, raw_input().split()))
    num = list(num1)
    res = list()
    c = 0
    for j in range(len(num)):
        if c == 0:
            temp = max(num)
            if temp not in res:
                res.append(temp)
                num.remove(temp)
                c = 1
        else:
            temp = min(num)
            if temp not in res:
                res.append(temp)
                num.remove(temp)
                c = 0
    resl = list(map(str, res))
    print(" ".join(resl))