You are given a sequence b_1, b_2, …, b_n. Find the lexicographically minimal permutation a_1, a_2, …, a_{2n} such that b_i = min(a_{2i-1}, a_{2i}), or determine that it is impossible.

Input

Each test contains one or more test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100).

The first line of each test case consists of one integer n — the number of elements in the sequence b (1 ≤ n ≤ 100).

The second line of each test case consists of n different integers b_1, …, b_n — elements of the sequence b (1 ≤ b_i ≤ 2n).

It is guaranteed that the sum of n by all test cases doesn't exceed 100.

Output

For each test case, if there is no appropriate permutation, print one number -1.

Otherwise, print 2n integers a_1, …, a_{2n} — required lexicographically minimal permutation of numbers from 1 to 2n.

Example

Input


5
1
1
2
4 1
3
4 1 3
4
2 3 4 5
5
1 5 7 2 8


Output


1 2 
-1
4 5 1 2 3 6 
-1
1 3 5 6 7 9 2 4 8 10 
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;

public class C {
	public void run() throws Exception {
		FastScanner sc = new FastScanner();
		
		int test = sc.nextInt();
		outer:
		for (int j = 0; j<test; j++) {
			int n = sc.nextInt();
			int[] b = new int[n];
			int[] a = new int[2*n];
			int[] dupb = new int[n];
			int[] not = new int[n];
			for (int i = 0; i<n; i++) {
				b[i] = sc.nextInt();
				dupb[i] = b[i];
				a[2*i] = b[i];
			}
			Arrays.sort(dupb);
			int point = 0;
			int points = 0;
			for (int i = 1; i<=2*n; i++) {
				if (point==n) {
					not[points] = i;
					points++;
				}
				else if (dupb[point] == i) {
					point++;
				}
				else {
					not[points] = i;
					points++;
				}
			}
			if (not[0] == 1 || dupb[n-1] == 2*n) {
				System.out.println(-1);
				continue;
			}
			boolean[] ok = new boolean[n];
			Arrays.fill(ok, true);
		
			for (int i = 0; i<n; i++) {
				for (int x = 0; x<n+1; x++) {
					if (x == n) {
						System.out.println(-1);
						continue outer;
					}
					else if (a[2*i]>not[x]) {
						;
					}
					else if (!ok[x]) ;
					else {
						a[2*i+1] = not[x];
						ok[x] = false;
						break;
					}
				}
			}
			for (int i = 0; i<n; i++) {
				System.out.print(a[2*i] + " " + a[2*i+1] + " ");
			}
			System.out.println();
		}
	}
	static class FastScanner {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public FastScanner() {
			reader = new BufferedReader(new InputStreamReader(System.in), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}

	}
	public static void main (String[] args) throws Exception {
		new C().run();
	}
}