#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define ll2(x, y) ll x, y; cin >> x >> y;
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

int f[9][9];
int dh[9] = {0, 0, 0, 1, 1, 1, 2, 2, 2};
int dw[9] = {0, 1, 2, 0, 1, 2, 0, 1, 2};

signed main(void){
  int i, j, k, l, m;
  int(n);
  for(int testcase = 0;testcase < n;testcase++){
    if(testcase != 0)puts("");
    rep(i, 9)rep(j, 9)scanf("%d", &f[i][j]);
    rep(i, 9){
      rep(j, 9){
        bool is = true;
        rep(k, 9){
          if(i != k)if(f[i][j] == f[k][j])is = false;
          if(j != k)if(f[i][j] == f[i][k])is = false;
          if(i % 3 != dh[k] && j % 3 != dw[k])
          if(f[i][j] == f[i / 3 * 3 + dh[k]][j / 3 * 3 + dw[k]])is = false;
        }
        if(is)printf(" %d", f[i][j]);
        else printf("*%d", f[i][j]);
      }
      puts("");
    }


//*/

//*/ break;
  }
  return 0;
}