B. Restore the Permutation by Merger

B. Restore the Permutation by Merger

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A permutation of length n is a sequence of integers from 1 to n of length n containing each number exactly once. For example, [1], [4,3,5,1,2], [3,2,1] are permutations, and [1,1], [0,1], [2,2,1,4] are not.

There was a permutation p[1…n]. It was merged with itself. In other words, let's take two instances of p and insert elements of the second p into the first maintaining relative order of elements. The result is a sequence of the length 2n.

For example, if p=[3,1,2] some possible results are: [3,1,2,3,1,2], [3,3,1,1,2,2], [3,1,3,1,2,2]. The following sequences are not possible results of a merging: [1,3,2,1,2,3], [3,1,2,3,2,1], [3,3,1,2,2,1].

For example, if p=[2,1] the possible results are: [2,2,1,1], [2,1,2,1]. The following sequences are not possible results of a merging: [1,1,2,2], [2,1,1,2], [1,2,2,1].

Your task is to restore the permutation 𝑝$p$ by the given resulting sequence 𝑎$a$. It is guaranteed that the answer exists and is unique.

You have to answer 𝑡$t$ independent test cases.

Input

The first line of the input contains one integer 𝑡$t$ (1≤𝑡≤400$1\le t\le 400$) — the number of test cases. Then 𝑡$t$ test cases follow.

The first line of the test case contains one integer 𝑛$n$ (1≤𝑛≤50$1\le n\le 50$) — the length of permutation. The second line of the test case contains 2𝑛$2n$ integers 𝑎1,𝑎2,…,𝑎2𝑛$a_1,a_2,\dots ,a_{2n}$ (1≤𝑎𝑖≤𝑛$1\le a_i\le n$), where 𝑎𝑖$a_i$ is the  𝑖$i$-th element of 𝑎$a$. It is guaranteed that the array  𝑎$a$ represents the result of merging of some permutation  𝑝$p$ with the same permutation 𝑝$p$.

Output

For each test case, print the answer: 𝑛$n$ integers 𝑝1,𝑝2,…,𝑝𝑛$p_1,p_2,\dots ,p_n$ (1≤𝑝𝑖≤𝑛$1\le p_i\le n$), representing the initial permutation. It is guaranteed that the answer exists and is unique.

Example

input

Copy

5
2
1 1 2 2
4
1 3 1 4 3 4 2 2
5
1 2 1 2 3 4 3 5 4 5
3
1 2 3 1 2 3
4
2 3 2 4 1 3 4 1

output

Copy

1 2 
1 3 4 2 
1 2 3 4 5 
1 2 3 
2 3 4 1