#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;

int n, t, x;
char a[405][405];
bool valid(int x) {

    return (x < n && x>-1);
}

int main() {

    scanf("%d",&t);
    while(t--) {
        vector<pair<int, int>>idx, res(2);
        scanf("%d",&n);
        for(int i = 0 ; i<n ; ++i) {
            for(int j =0 ; j< n ; ++j) {
                scanf(" %c",&a[i][j]);
                if (a[i][j] == '*') {
                    idx.push_back({i, j});
                }
            }
        }

        if (idx[0].first == idx[1].first) {
            if (valid(idx[0].first +1 ))res[0]= {idx[0].first +1, idx[0].second}, res[1]= {idx[0].first +1, idx[1].second} ;
            else res[0]= {idx[0].first- 1, idx[0].second}, res[1]= {idx[0].first -1, idx[1].second} ;
        }

        else if (idx[0].second == idx[1].second) {
            if (valid(idx[0].second +1 ))res[0]= {idx[0].first, idx[0].second + 1}, res[1]= {idx[1].first, idx[1].second +1} ;
            else res[0]= {idx[0].first, idx[0].second - 1}, res[1]= {idx[1].first, idx[1].second -1} ;
        }

        else res[0] = {idx[0].first, idx[1].second}, res[1] = {idx[1].first, idx[0].second};

        a[res[0].first][res[0].second] = '*';
        a[res[1].first][res[1].second] = '*';

        for(int i = 0 ; i < n ; ++i) {
            for(int j = 0 ; j< n ; ++j) {
                printf("%c",a[i][j]);
            }
            puts("");
        }
    }


    return 0;
}



