#include<bits/stdc++.h>
#define cases long long test;cin>>test;while(test--)
#define f_io ios::sync_with_stdio(false); cin.tie(0)
#define foi(a,n) for(long long i=a;i<n;i++)
#define foj(a,n) for(long long j=a;j<n;j++)
#define fok(a,n) for(long long k=a;k<n;k++)
#define ll long long
#define MOD 1000000007
#define INF 1000000000
using namespace std;

int main()
{
    f_io;
    cases
    {
        ll n;
        cin >> n;
        vector<string> arr(n);
        foi(0,n)    
            cin >> arr[i];
        vector<pair<ll,ll> > tmp;
        set<pair<ll,ll> > st;
        foi(0,n)
        {
            foj(0,n)
            {
                if(arr[i][j] == '*')
                    tmp.push_back({i,j});
            }
        }
        st.insert({min(tmp[0].first,tmp[1].first),min(tmp[0].second,tmp[1].second)});
        st.insert({max(tmp[0].first,tmp[1].first),min(tmp[0].second,tmp[1].second)});
        st.insert({min(tmp[0].first,tmp[1].first),max(tmp[0].second,tmp[1].second)});
        st.insert({max(tmp[0].first,tmp[1].first),max(tmp[0].second,tmp[1].second)});
        if(st.size() == 2)
        {
            if(tmp[0].second == tmp[1].second)
            {
                st.insert({tmp[0].first,(tmp[0].second+1)%n});
                st.insert({tmp[1].first,(tmp[1].second+1)%n});
            }
            else
            {
                st.insert({(tmp[0].first+1)%n,tmp[0].second});
                st.insert({(tmp[1].first+1)%n,tmp[1].second});
            }
        }
        for(auto [x,y] : st)
            arr[x][y] = '*';
        foi(0,n)
            cout << arr[i] << "\n";
    }
    return 0;
}