#include <bits/stdc++.h>

using namespace std;
#define int long long
#define rep(i, a, b) for(int i=(a);i<=(b);++i)
#define per(i, a, b) for(int i=(a);i>=(b);--i)
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)x.size()
#define endl "\n"
const int N = 2e5 + 5, mod = 998244353, inf = 1e18;

void solve() {
    int n;
    cin>>n;
    vector a(8,vector<char>(n+2,'.'));
    rep(i,1,n){
        char x;
        cin>>x;
        a[1][i]=x;
    }
    rep(i,1,n){
        char x;
        cin>>x;
        a[7][i]=x;
    }

    auto chk=[&](int x){
        rep(i,1,n){
            if(a[x][i]=='.') return false;
        }
        return true;
    };
    if(chk(1) && chk(7)){
        cout<<"Yes"<<endl;
        rep(i,1,7){
            rep(j,1,n)cout<<'#';
            cout<<endl;
        }
        return;
    }
    rep(i,1,n){
        if(a[1][i]=='.') a[2][i]='#';
        if(a[1][i]=='#') a[2][i]='.';
    }
    rep(i,1,n){
        if(a[7][i]=='#') a[6][i]='.';
        if(a[7][i]=='.') a[6][i]='#';
    }

    int fl=-1,fr=-1;
    for(int i=1;i<=n;i++){
        if(a[2][i]=='.' && (a[2][i-1]=='#' || a[2][i+1]=='#')){
            fl=i;
            break;
        }
    }
    for(int i=1;i<=n;i++){
        if(a[6][i]=='.' && (a[6][i-1]=='#' || a[6][i+1]=='#')){
            fr=i;
            break;
        }
    }
    if(fl==-1 || fr==-1){
        cout<<"No\n";
        return;
    }

    cout<<"Yes\n";
    a[3][fl]='#';
    a[5][fr]='#';

    if(abs(fl-fr)<=1){
        a[4][fl]='#';
    }
    else{
        if(fl>fr) swap(fl,fr);
        rep(i,fl+1,fr-1){
            a[4][i]='#';
        }
    }
    rep(i,1,7){
        rep(j,1,n)cout<<a[i][j];
        cout<<endl;
    }
}

signed main() {
    IOS
    int64_t tt = 1;
    cin >> tt;
    rep(kase, 1, tt) solve();
}
/*
4
4
#..#
.##.
5
##.#.
.#.##
6
######
.####.
27
.######.######.####.#.#####
.####...####..#.......#####
 */