Problem: A PIN code is a string that consists of exactly 4 digits. Examples of possible PIN codes: 7013, 0000 and 0990. Please note that the PIN code can begin with any digit, even with 0.

Polycarp has n (2 ≤ n ≤ 10) bank cards, the PIN code of the i-th card is p_i.

Polycarp has recently read a recommendation that it is better to set different PIN codes on different cards. Thus he wants to change the minimal number of digits in the PIN codes of his cards so that all n codes would become different.

Formally, in one step, Polycarp picks i-th card (1 ≤ i ≤ n), then in its PIN code p_i selects one position (from 1 to 4), and changes the digit in this position to any other. He needs to change the minimum number of digits so that all PIN codes become different.

Polycarp quickly solved this problem. Can you solve it?

Input

The first line contains integer t (1 ≤ t ≤ 100) — the number of test cases in the input. Then test cases follow.

The first line of each of t test sets contains a single integer n (2 ≤ n ≤ 10) — the number of Polycarp's bank cards. The next n lines contain the PIN codes p_1, p_2, ..., p_n — one per line. The length of each of them is 4. All PIN codes consist of digits only.

Output

Print the answers to t test sets. The answer to each set should consist of a n + 1 lines

In the first line print k — the least number of changes to make all PIN codes different. In the next n lines output the changed PIN codes in the order corresponding to their appearance in the input. If there are several optimal answers, print any of them.

Example

Input


3
2
1234
0600
2
1337
1337
4
3139
3139
3139
3139


Output


0
1234
0600
1
1337
1237
3
3139
3138
3939
6139

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
bool comp(long long a, long long b) { return a > b; }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long a, long long n) {
  long long res = 1;
  while (n > 0) {
    if (n % 2 != 0) {
      res *= a;
      n -= 1;
    } else {
      a *= a;
      n /= 2;
    }
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6) {
    if (n % i == 0 || n % (i + 2) == 0) {
      return false;
    }
  }
  return true;
}
void primeFactors(long long n) {
  while (n % 2 == 0) {
    cout << 2 << " ";
    n = n / 2;
  }
  for (long long i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      cout << i << " ";
      n = n / i;
    }
  }
  if (n > 2) {
    cout << n << " ";
  }
}
void printDivisors(long long n) {
  for (long long i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        printf("%d ", i);
      else
        printf("%d %d ", i, n / i);
    }
  }
}
void BellmanFord(long long graph[][3], long long V, long long E,
                 long long src) {
  long long dis[V];
  for (long long i = 0; i < V; i++) dis[i] = INT_MAX;
  dis[src] = 0;
  for (long long i = 0; i < V - 1; i++) {
    for (long long j = 0; j < E; j++) {
      if (dis[graph[j][0]] + graph[j][2] < dis[graph[j][1]])
        dis[graph[j][1]] = dis[graph[j][0]] + graph[j][2];
    }
  }
  bool flag = true;
  for (long long i = 0; i < E; i++) {
    long long x = graph[i][0], y = graph[i][1], weight = graph[i][2];
    if (dis[x] != INT_MAX && dis[x] + weight < dis[y]) {
      flag = false;
      break;
    }
  }
}
void topoSort(long long n, long long m, vector<vector<bool>> &e,
              vector<bool> &visited, long long x) {
  visited[x] = true;
  for (long long i = n - 1; i >= 0; i--) {
    if (e[x][i] and !visited[i]) {
      topoSort(n, m, e, visited, i);
    }
  }
  return;
}
void convertGraphToTree(long long x, vector<vector<long long>> &v,
                        vector<bool> &visited,
                        vector<vector<long long>> &newedges) {
  visited[x] = true;
  for (long long i = 0; i < v[x].size(); i++) {
    if (!visited[v[x][i]]) {
      newedges[x].push_back(v[x][i]);
      convertGraphToTree(v[x][i], v, visited, newedges);
    }
  }
  return;
}
long long subtreeCount(long long x, vector<vector<long long>> &v,
                       vector<bool> &visited, vector<long long> &count) {
  visited[x] = true;
  long long ans = 1;
  for (long long i = 0; i < v[x].size(); i++) {
    if (!visited[v[x][i]]) {
      ans += subtreeCount(v[x][i], v, visited, count);
    }
  }
  count[x] = ans;
  return ans;
}
void create_sparse_table(long long n, vector<long long> &v) {
  long long k = (long long)log2(n * 1.0);
  vector<vector<long long>> st(n + 1, vector<long long>(k + 1, 0));
  for (long long i = 0; i < n; i++) st[i][0] = v[i];
  for (long long j = 1; j <= k; j++) {
    for (long long i = 0; i + (1 << j) <= n; i++)
      st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
  }
  return;
}
void helper(long long n, vector<string> &v) {
  unordered_map<string, long long> make_pair;
  bool check = false;
  for (long long i = 0; i < n; i++) {
    make_pair[v[i]] += 1;
    if (make_pair[v[i]] > 1) {
      check = true;
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    if (make_pair[v[i]] > 1) {
      check = false;
      for (long long j = 0; j < 4; j++) {
        for (long long a = 0; a <= 9; a++) {
          string temp = v[i];
          char ch = '0' + a;
          temp[j] = ch;
          if (!make_pair.count(temp)) {
            ans += 1;
            check = true;
            make_pair[v[i]] -= 1;
            v[i] = temp;
            make_pair[temp] += 1;
            break;
          }
        }
        if (check) {
          break;
        }
      }
    }
  }
  cout << ans << endl;
  for (long long i = 0; i < n; i++) {
    cout << v[i] << endl;
  }
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<string> a(n, "");
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
    }
    helper(n, a);
  }
  return 0;
}