#include<bits/stdc++.h>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define   pb              push_back
#define   rep(i,a,b)      for(int i=a;i<b;i++)
#define   vl              vector<ll>
#define   vi              vector<int>
#define   lb              lower_bound
#define   ub              upper_bound
// vector<vector<int>> vec( n , vector<int> (m, 0));
typedef int64_t ll;
bool prime[100000];
ll gcd(ll a, ll b) {
	if (b == 0)
		return a;
	return gcd(b, a % b);
}
void SieveOfEratosthenes()
{
	memset(prime, true, sizeof(prime));

	for (int p = 2; p * p <= 100000; p++)
	{
		if (prime[p] == true)
		{
			for (int i = p * p; i <= 100000; i += p)
				prime[i] = false;
		}
	}
}
long long binpow(long long a, long long b) {
	a %= MOD;
	long long res = 1;
	while (b > 0) {
		if (b & 1)
			res = res * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return res % MOD
	       ;
}
ll invmd(ll n)
{
	return (binpow(n, MOD - 2));
}
void solve()
{
	int n;
	cin >> n;
	vector<vector<char>> vec( n , vector<char> (n, '0'));
	vector<pair<int, int>>mp;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> vec[i][j];
			if (vec[i][j] == '*')
			{
				mp.pb({i, j});

			}
		}
	}
	int x1 = mp[0].first;
	int y1 = mp[0].second;
	int x2 = mp[1].first;
	int y2 = mp[1].second;
	if (x1 == x2)
	{
		vec[(x1 + 1) % n][y1] = '*';
		vec[(x1 + 1) % n][y2] = '*';
	}
	else if (y1 == y2)
	{
		vec[x1][(y1 + 1) % n] = '*';
		vec[x2][(y1 + 1) % n] = '*';
	}
	else
	{
		vec[x2][y1] = '*';
		vec[x1][y2] = '*';

	}

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cout << vec[i][j];
		}
		cout << endl;
	}








}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
#ifndef ONLINE_JUDGE
	freopen("input.in", "r", stdin);
	freopen("output.out", "w", stdout);
#endif
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}

