Description

There is an ACMer named The_Flash, who can write g♂♂d code in SDNU ACM Traing Team. With his excellent coding skills, he has won a lot of praises.

Now, he gives you an easy problem to solve, the problem is showen as follows.

Give you a sequence with $n$​ integers, it is guaranteed that only two different integers appear once and other integers are all appear twice. You are expected to find out that two "single" integers.

Format

Input

The first line is an integer T($1<=T<=10$), denoting the number of testcases.

For each testcase, there is an integer $n(1<=n<=1000000)$, then following $n$ integers $a_i(0<=a_i<=1000000000)$, there is a space between every two integers.

##Output For each testcase, output two integer, denoting the answer. (In order from small to large).

Samples

2
2
1 2
10
1 1 2 2 3 3 4 4 6 5

1 2
5 6