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 
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e16;
const long long N = 1e5 + 1;
const long long mod = 1e9 + 7;
void solve() {
  long long n;
  cin >> n;
  long long b[n + 1];
  for (long long i = 1; i <= n; i++) {
    cin >> b[i];
  }
  deque<long long> ans(2 * n + 1), rem;
  for (long long i = 1; i <= 2 * n; i++) {
    rem.push_back(i);
  }
  for (long long i = 1; i <= n; i++) {
    auto it = find(rem.begin(), rem.end(), b[i]);
    if (it != rem.end()) {
      rem.erase(it);
    }
  }
  for (long long i = 1; i <= n; i++) {
    ans[2 * i - 1] = b[i];
    auto it = upper_bound(rem.begin(), rem.end(), b[i]);
    if (it == rem.end()) {
      cout << -1 << "\n";
      return;
    }
    ans[2 * i] = *it;
    rem.erase(it);
  }
  ans.pop_front();
  for (auto x : ans) {
    cout << x << " ";
  }
  cout << "\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
