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 ≤ t ≤ 400) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1 ≤ n ≤ 50) — the length of permutation. The second line of the test case contains 2n integers a_1, a_2, ..., a_{2n} (1 ≤ a_i ≤ 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 p_1, p_2, ..., p_n (1 ≤ p_i ≤ n), representing the initial permutation. It is guaranteed that the answer exists and is unique.

Example

Input


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


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

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.sql.Array;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.Map.Entry;


import java.util.*;

public class a {
	static long mod = 1000000007L;

	 public static void main(String[] args) throws Exception {
	        in = new BufferedReader(new InputStreamReader(System.in));
	        out = new PrintWriter(System.out);
	        sc = new FastScanner(in);
	       HashMap<Integer , HashMap<Integer , ArrayList<Integer>>> map = new HashMap<>();
	       int t =sc.nextInt();
	       while(t-->0) {
	    	   int n =sc.nextInt();
	    	 long [] a = input(2*n);
	    	 boolean[ ] vis = new boolean[n+1];
	    	 for(long val : a) {
	    		if(vis[(int)val])continue;
	    		out.print(val+" ");
	    		vis[(int)val]=true;
	    	}
	       out.println();
	       
	       
	       }
	        out.flush();    
	    }
	 static class pair {
		 int ver ;
		 int val;
	 }
	 
	static int[] par;
	static int[] rank;

	static void build(int n) {
		par = new int[n + 1];
		rank = new int[n + 1];
		for (int i = 0; i < n; i++)
			par[i] = i;
	}

	static int find(int u) {
		if (u == par[u])
			return u;
		int v = find(par[u]);
		par[u] = v;
		return v;
	}

	static void union(int u, int v) {
		u = par[u];
		v = par[v];

		if (rank[u] > rank[v]) {
			par[v] = u;
		} else {
			par[u] = v;
			if (rank[u] == rank[v]) {
				rank[v]++;
			}
		}
	}




	public static TreeMap<Integer, TreeSet<Integer>> directed(int n, int m) throws Exception {
		TreeMap<Integer, TreeSet<Integer>> map = new TreeMap<>();
		for (int i = 0; i < n; i++)
			map.put(i, new TreeSet<Integer>());
		for (int i = 0; i < m; i++) {
			int a = sc.nextInt() - 1;
			int b = i;
			map.get(b).add(a);
		}
		return map;
	}

	public static long[] input(int n) throws Exception {

		long[] arr = new long[n];
		for (int i = 0; i < n; i++) {
			arr[i] = sc.nextLong();
		}
		return arr;
	}

	public static long[][] input(int n, int m) throws Exception {

		long[][] arr = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {

				arr[i][j] = sc.nextInt();
			}
		}
		return arr;
	}

	static BufferedReader in;
	static FastScanner sc;
	static PrintWriter out;

	static class FastScanner {
		BufferedReader in;
		StringTokenizer st;

		public FastScanner(BufferedReader in) {
			this.in = in;
		}

		public String nextToken() throws Exception {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(in.readLine());
			}
			return st.nextToken();
		}

		public int nextInt() throws Exception {
			return Integer.parseInt(nextToken());
		}

		public long nextLong() throws Exception {
			return Long.parseLong(nextToken());
		}

		public double nextDouble() throws Exception {
			return Double.parseDouble(nextToken());
		}
	}
}