#include<bits/stdc++.h>
#define int long long
#define db double
#define pii pair<int, int>
#define ll long long
using namespace std;

int f(char c){
    return (c == '#');
}
char g(int n){
    if(n==0)return '.' ;
    return '#';
}
void solve() {
    int n;
    cin >> n;
    vector<vector<int>> a(9, vector<int>(n + 3));
    auto print = [&]()
    {
        cout << "Yes\n";
        for (int i = 1;i<=7;i++)
        {
            for (int j = 1; j <= n; j++)
                cout << g(a[i][j]);
            cout << '\n';
        }
    };
    auto fan = [&](int u, int v,int k)
    {
        for (int i = 1;i<=n;i++)a[u][i] = a[v][i] ^ k;
    };
    int last[9]{};
    int num[9]{};
    for(int j=1;j<=7;j+=6)
    for (int i = 1; i <= n;i++){
        char u;cin>>u;
        a[j][i] = f(u);
        num[j] += f(u);
    }
    for(int j=1;j<=7;j+=6)
    for (int i = 1; i <= n;i++){
        if(i!=n)
        if(a[j][i+1]==0&&a[j][i]==1)last[j]=i;
        if(i>1)
        if(a[j][i-1]==0&&a[j][i]==1)last[j]=i;
    }    
    if(num[1]==n&&num[7]==n){
        for (int i = 2;i<=6;i++)fan(i, 1, 0);
        print();
        return;
    }
    if(num[1]==0){
        fan(6,7,1);print();return;
    }
    if(num[7]==0){
        fan(2,1,1);print();return;
    }
    if(num[1]==n||num[7]==n){
        cout << "No\n";
        return;
    }
    fan(2,1,1);
    fan(6,7,1);
    a[3][last[1]] = 1;
    a[5][last[7]] = 1;
    if(abs(last[1]-last[7])<=1){
        a[4][last[1]] = 1;
        print();
        return;
    }
    for (int i = min(last[1], last[7]) + 1; i < max(last[1], last[7]);i++)
    a[4][i] = 1;
    print();
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}