Problem: 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 

Solution (in JAVA):

Solution:
        import java.io.*;
        import java.util.*;
        import java.math.*;
        import java.lang.*;
         
         
         
        public class B implements Runnable {
     
            
            public void run() {
               
                final InputReader sc = new InputReader(System.in);
                final PrintWriter out = new PrintWriter(System.out);
               
                int t=sc.nextInt();
                while(t--!=0)
                {
                    int n=sc.nextInt();
                    Set<Integer> s1=new HashSet<Integer>();
                    for(int i=0;i<n*2;i++)
                    {
                        int x=sc.nextInt();
                        if(!s1.contains(x))
                        {
                            s1.add(x);
                            out.println(x);
     
                        }
     
                    
                    }
                    out.println();
                    
     
                    
     
                }
     
                   
     
     
     
                out.close();
            
            
                
                
                }
         
        //========================================================
         
            static class Pair
            {
                int a,b;
                Pair(final int aa,final int bb)
                {
                    a=aa;
                    b=bb;
                }
            }
            
            static void sa(final int a[],final InputReader sc)
            {
                for(int i=0;i<a.length;i++)
                {
                    a[i]=sc.nextInt();
                }
                Arrays.sort(a);
            }
         
            static class InputReader {
                private final InputStream stream;
                private final byte[] buf = new byte[1024];
                private int curChar;
                private int numChars;
                private SpaceCharFilter filter;
                private final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         
                public InputReader(final InputStream stream) {
                    this.stream = stream;
                }
               
                public int read() {
                    if (numChars==-1)
                        throw new InputMismatchException();
                   
                    if (curChar >= numChars) {
                        curChar = 0;
                        try {
                            numChars = stream.read(buf);
                        }
                        catch (final IOException e) {
                            throw new InputMismatchException();
                        }
                       
                        if(numChars <= 0)              
                            return -1;
                    }
                    return buf[curChar++];
                }
             
                public String nextLine() {
                    String str = "";
                    try {
                        str = br.readLine();
                    }
                    catch (final IOException e) {
                        e.printStackTrace();
                    }
                    return str;
                }
                public int nextInt() {
                    int c = read();
                   
                    while(isSpaceChar(c))
                        c = read();
                   
                    int sgn = 1;
                   
                    if (c == '-') {
                        sgn = -1;
                        c = read();
                    }
                   
                    int res = 0;
                    do {
                        if(c<'0'||c>'9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    while (!isSpaceChar(c));
                   
                    return res * sgn;
                }
               
                public long nextLong() {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    int sgn = 1;
                    if (c == '-') {
                        sgn = -1;
                        c = read();
                    }
                    long res = 0;
                   
                    do {
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    while (!isSpaceChar(c));
                        return res * sgn;
                }
               
                public double nextDouble() {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    int sgn = 1;
                    if (c == '-') {
                        sgn = -1;
                        c = read();
                    }
                    double res = 0;
                    while (!isSpaceChar(c) && c != '.') {
                        if (c == 'e' || c == 'E')
                            return res * Math.pow(10, nextInt());
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    if (c == '.') {
                        c = read();
                        double m = 1;
                        while (!isSpaceChar(c)) {
                            if (c == 'e' || c == 'E')
                                return res * Math.pow(10, nextInt());
                            if (c < '0' || c > '9')
                                throw new InputMismatchException();
                            m /= 10;
                            res += (c - '0') * m;
                            c = read();
                        }
                    }
                    return res * sgn;
                }
               
                public String readString() {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    final StringBuilder res = new StringBuilder();
                    do {
                        res.appendCodePoint(c);
                        c = read();
                    }
                    while (!isSpaceChar(c));
                   
                    return res.toString();
                }
             
                public boolean isSpaceChar(final int c) {
                    if (filter != null)
                        return filter.isSpaceChar(c);
                    return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
                }
             
                public String next() {
                    return readString();
                }
               
                public interface SpaceCharFilter {
                    public boolean isSpaceChar(int ch);
                }
            }
         
            public static void main(final String args[]) throws Exception {
                new Thread(null, new B(),"Main",1<<27).start();
            }
        }