#include <bits/stdc++.h>

using namespace std;
int n, m, chk[110][110], dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
string s[101];
queue<int> q;
int main()
{
    freopen(".1.in","r",stdin);
    freopen(".1.out","w",stdout);
    int t;
    cin>>t;
    while(t--)
    {
        int xx, yy, p = 0, d = -1, c = 0;
        queue<int> qx, qy;
        cin>>n;
        for(int i = 0 ; i < n ; i++ )
        {
            cin>>s[i];
            for(int j = 0 ; j < n ; j++ )
            {
                chk[i][j] = 0;
                if( s[i][j] == 'i' ) xx = i, yy = j;
            }
        }
        qx.push(xx), qy.push(yy), chk[xx][yy] = 1;
        while( !qx.empty() )
        {
            int x = qx.front(), y = qy.front(); qx.pop(), qy.pop();
            for(int i = 0 ; i < 4 ; i++ )
            {
                int X = x+dx[i], Y = y+dy[i];
                if( X < 0 or X > n-1 or Y < 0 or Y > n-1 ) continue;
                if( chk[X][Y] == 1 ) continue;
                chk[X][Y] = 1;
                qx.push(X), qy.push(Y);
                if( s[X][Y] == 't' )
                {
                    if( abs(xx-x)+abs(yy-y) > d ) c++, s[X][Y] = (p=c)+'0', d = abs(xx-x)+abs(yy-y);
                    else s[X][Y] = p+'0', c++;
                }
            }
        }
        for(int i = 0 ; i < n ; i++ ) cout<<s[i]<<endl;
    }
}