#include <bits/stdc++.h>
#include <cmath> 
using namespace std;
#define MOD 1000000007
int st =0;
typedef long long int lli;
/*
int findTheOnlyDifferent(int arr[], int n)
{
    // Array size must be at least two.
    if (n == 1)
        return -1;
  
    // If there are two elements, then we
    // can return any one element as different
    if (n == 2)
        return 0;
  
    // Check if the different element is among
    // first three
    if (arr[0] == arr[1] && arr[0] != arr[2])
        return 2;
    if (arr[0] == arr[2] && arr[0] != arr[1])
        return 1;
    if (arr[1] == arr[2] && arr[0] != arr[1])
        return 0;
  
    for (int i = 3; i < n; i++)
        if (arr[i] != arr[i - 1])
            return i;
  
    return -1;
}*/

int main(){
	#ifndef ONLINE_JUDGE
		freopen("input.txt","r",stdin);
		freopen("output.txt","w",stdout);
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	cin>>t;
	while(t--){
		int n ;
		vector<int> i1;
		vector<int> j1;
		cin>>n;
		char a[n][n];
		
		for(int i=0; i<n; i++){
			
			for(int j=0; j<n; j++){
				cin>>a[i][j];
				if(a[i][j] == '*'){
					i1.push_back(i) ;
					j1.push_back(j) ;
				}
			}
		}
		//cout<<i1[0]<<" "<<j1[0]<<" "<<j1[1]<<endl;
		if(i1[0] == i1[1]){
			if (i1[0]>0 ){
				a[i1[0]-1][j1[0]] = '*';
				a[i1[0]-1][j1[1]] = '*';
			}
			else{
				a[i1[0]+1][j1[0]] = '*';
				a[i1[1]+1][j1[1]] = '*';
			}
		}
		else if(j1[0] == j1[1]){
			if (j1[0]>0 ){
				a[i1[0]][j1[0]-1] = '*';
				a[i1[1]][j1[1]-1] = '*';
			}
			else{
				a[i1[0]][j1[0]+1] = '*';
				a[i1[1]][j1[1]+1] = '*';
			}
		}
		else{
			
				a[i1[1]][j1[0]] = '*';
				a[i1[0]][j1[1]] = '*';
		}

		for(int i=0; i<n; i++){
			
			for(int j=0; j<n; j++){
				cout<<a[i][j];
			}
			cout<<"\n";
		}

	
	}
}