//
// Created by 16373 on 2024/11/13.
//
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
char x[10][100005];
void solve(){
    int n;
    cin>>n;
    string a,b;
    cin>>a>>b;
    bool aq=true,bq=true;
    for(int i=0;i<n-1;++i)
    {
        if(a[i]!=a[i+1]) aq=false;
        if(b[i]!=b[i+1]) bq=false;
    }
    if(aq&&bq)
    {
        cout<<"Yes\n";
        cout<<a<<"\n";
        for(int i=0;i<5;++i)
        {
            for(int j=0;j<n;++j)
            {
                cout<<'#';
            }
            cout<<"\n";
        }
        cout<<b<<"\n";
        return;
    }
    else if(aq||bq)
    {
        cout<<"No\n";
        return;
    }
    for(int i=0;i<n;++i)
    {
        x[1][i]=(a[i]=='#'?'.':'#');
        x[5][i]=(b[i]=='#'?'.':'#');
    }
    for(int i=0;i<n;++i)
    {
        x[2][i]='.';
        x[4][i]='.';
    }
    int l,r;
    for(int i=0;i<n;++i)
    {
        if(x[1][i]=='.'&&((i-1>=0&&x[1][i-1]=='#')||(i+1<n&&x[1][i+1]=='#')))
        {
            x[2][i]='#';
            l=i;
            break;
        }
    }
    for(int i=0;i<n;++i)
    {
        if(x[5][i]=='.'&&((i-1>=0&&x[5][i-1]=='#')||(i+1<n&&x[5][i+1]=='#')))
        {
            x[4][i]='#';
            r=i;
            break;
        }
    }
    for(int i=0;i<n;++i)
    {
        x[3][i]='.';
    }
    if(l>r) swap(l,r);
    if(l==r||l==r-1)
    {
        x[3][l]='#';
    }
    else {
        for (int i = l + 1; i < r;++i)
        {
            x[3][i]='#';
        }
    }
    cout<<"Yes\n";
    cout<<a<<'\n';
    for(int i=1;i<=5;i++){
        for(int j=0;j<n;j++){
            cout<<x[i][j];
        }
        cout<<'\n';
    }
    cout<<b<<'\n';
    //cout<<a<<"\n"<<x[1]<<"\n"<<x[2]<<"\n"<<x[3]<<"\n"<<x[4]<<"\n"<<x[5]<<"\n"<<b<<"\n";
}
signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
/*
4
4
#..#
.##.
5
##.#.
.#.##
6
######
.####.
27
.######.######.####.#.#####
.####...####..#.......#####
*/