/****************************************** By Lord Sanskar Bhargava******************************/  
#include<bits/stdc++.h>
using namespace std;

 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define pb push_back
#define all(v) (v).begin(),(v).end()
#define set1(x) __builtin_popcount(x)
#define gcd(a,b) __gcd(a,b)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define bk(i,a,b) for(ll i=a;i>b;i--)
#define fastio ios::sync_with_stdio(0);cin.tie(0);
#define mp make_pair

void run_test_cases()
{
  ll n;
  cin>>n;
  string s[n];
  rep(i,0,n)
  {
    cin>>s[i];
  }
  vector<pair<ll,ll>>v;
  rep(i,0,n)
  {
  rep(j,0,n)
  {
    if(s[i][j]=='*')v.pb({i,j});
  }
}
  if(v[0].first==v[1].first)
  {
    ll x=v[0].first;
    if(x+1<n)
    {
      s[x+1][v[0].second]='*';
      s[x+1][v[1].second]='*';
    }
    else
    {
      s[x-1][v[0].second]='*';
      s[x-1][v[1].second]='*';
    }
    rep(i,0,n)
    {
      cout<<s[i]<<endl;
    }
  }
  else if(v[0].second==v[1].second)
  {
    ll y=v[0].second;
    if(y+1<n)
    {
      s[v[0].first][y+1]='*';
      s[v[1].first][y+1]='*';
    }
    else
    {
       s[v[0].first][y-1]='*';
       s[v[1].first][y-1]='*';
    }
    rep(i,0,n)
    {
      cout<<s[i]<<endl;
    }
  }
  else
  {
    s[v[0].first][v[1].second]='*';
    s[v[1].first][v[0].second]='*';
    rep(i,0,n)
    {
      cout<<s[i]<<endl;
    }
  }
  
}
int main()
{
    fastio;
    int tt;
    cin>>tt;
    while(tt--)
    {
        run_test_cases();
        

    }
return 0;
}