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 
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
//package cf;


import java.util.Scanner;
import java.util.ArrayList;
public class CF {

   
    public static void main(String[] args) {
//       int x ;
//       Scanner input = new Scanner(System.in);
//       x=input.nextInt();
//       if(x==2||x==0)
//       {
//           System.out.println("no");
//       }
//       else if(x%2==0)
//       {
//           System.out.println("yes");
//       }
//       else
//       {
//           System.out.println("no");
//       }
   // String x="Localization";
   // int y;
   
   
    Scanner input = new Scanner(System.in);
   
    
//     
//        int z;
//        String x = null;
//        z=input.nextInt();
//        String list []=new String[z];
//        for(int i=0;i<z;i++)
//        {
//          
//            x=input.next();
//            list[i]=x;
//        }
//        
//        for(int i=0;i<z;i++)
//        {
//            String h=list[i];
//            if(h.length()>10)
//           {
//               char y=h.charAt(0);
//               System.out.print(y);
//               System.out.print(h.length()-2);
//               System.out.println(h.charAt(h.length()-1));
//               System.out.println(" ");
//           }
//           else
//           {
//               System.out.println(h);
//           }
//        }



            
//              int z =0;
//              int counter=0;
//              int count=0;
//              z=input.nextInt();
//              int [][]list=new int[z][3];
//              for(int row=0;row<z;row++)
//              {
//                  for(int col=0;col<3;col++)
//                  {
//                      int g=input.nextInt();
//                      list [row][col]=g;
//                  }
//              }
//             for(int i=0;i<z;i++)
//              {
//                   
//                  for(int j=0;j<3;j++)
//                  {
//                     if(list[i][j]==1)
//                     {
//                         counter++;
//                     }
//                  }
//                  if(counter>=2)
//                  {
//                      count++;
//                  }
//                  counter=0;
//                 
//              }
//                System.out.println(count);
//              
//     



      
       //Arraylist<integer[]> list;
      
       
                


//       int [] list1=new int[5];
//       ArrayList<int[]> list = new ArrayList<>();
//       
//       list.add(list1);
//       
//        System.out.println("Enter the number of groups of numbers ");
//        int x= input.nextInt();
//        for(int i=0;i<x;i++)
//        {
//            System.out.println("Enter the number of numbers ");
//            int y= input.nextInt();
//            int [] list2=new int [y*2];
//            for(int j=0;j<y*2;j++)
//            {
//                System.out.println("enter the numbers of th groups");
//                int g=input.nextInt();
//                list2[j]=g;
//            }
//            list.add(list2);
//           
            
            
//        }
     
                //        list.add(1);
          //        list.add(2);
          //        list.add(1);
          //        list.add(2);
          //        list.add(3);
          //        list.add(4);
          //        list.add(3);
          //        list.add(5);
          //        list.add(4);
          //        list.add(5);
      int z=input.nextInt();
      for(int l=0;l<z;l++)
    {
         ArrayList list=new ArrayList<>();
         //System.out.println("enter the size of the group");
         int a=input.nextInt();
         for(int m=0;m<a*2;m++)
         {
           //  System.out.println("enter the number ");
             int j=input.nextInt();
             list.add(j);
         }
        
        for(int i=0;i<list.size();i++)
        {
            
            for(int j=1;j<list.size();j++)
            {
                if(list.get(i)==list.get(j)&&i!=j)
                {
                    list.remove(j);
                  
                }
            }
        }
        for(int h=0;h<list.size();h++)
        {
            System.out.print(list.get(h)+" ");
        }
      //  System.out.println("");
        
     }
    
                
    }
    
}
