#include<bits/stdc++.h>
#include<bits/extc++.h>
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout.tie(nullptr);
#define all(x) (x).begin(),(x).end()
#define quchong(x) (x).erase(unique(all(x)),(x).end())
#define Yes(x,y) cout<<((x)?"Yes":"No")<<y
#define yes(x,y) cout<<((x)?"yes":"no")<<y
#define YES(x,y) cout<<((x)?"YES":"NO")<<y
#define ls ((u)<<1)
#define rs ((u)<<1|1)
#define mid (((l)+(r))>>1)
#define lowbit(x) ((x)&(-(x)))
#define itn int
#define asn ans
#define reisze resize
#define pdd pair<double,double>
#define pll pair<LL,LL>
#define pii pair<int,int>
#define tll tuple<LL,LL,LL>
#define tii tuple<int,int,int>
#define plll pair<LLL,LLL>
#define ULL unsigned long long
#define LL long long
#define LLL __int128
#define ld long double
#define ui64 uint64_t
#define ui32 uint32_t
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using RBTree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
T fang(const T& a){
    return a*a;
}
template<typename T,typename Q>
bool chmax(T& u1,T& u2,const Q& v){
    if(v>u1) { u2 = u1, u1 = v;return true;}
    if(v>u2){u2=v;return true;}
    return false;
}
template<typename T,typename Q>
bool chmin(T& u1,T& u2,const Q& v){
    if(v<u1) { u2 = u1, u1 = v;return true;}
    if(v<u2){u2=v;return true;}
    return false;
}
template<typename T,typename Q>
bool chmin(T& a,const Q& b){
    return a > b && (a = b, true);
}
template<typename T,typename Q>
bool chmax(T& a,const Q& b){
    return a<b&&(a=b,true);
}
template<typename t1,typename t2>
istream& operator>>(istream& in,pair<t1,t2>& pa){
    in>>pa.first>>pa.second;
    return in;
}
template<typename t1,typename t2>
ostream& operator<<(ostream& out,const pair<t1,t2>& pa){
    out<<pa.first<<' '<<pa.second;
    return out;
}
template<typename T>
istream& operator>>(istream& in,vector<T>& arr){
    for(auto& v:arr)in>>v;
    return in;
}
template<typename T>
ostream& operator<<(ostream& out,const vector<T>& arr){
    for(auto& v:arr)out<<v<<' ';
    return out;
}
int rand(int l,int r){
    static mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
    return uniform_int_distribution<int>(l, r)(rng);
}
const ld eps=1e-9;
const int NN=2e6+5;
const int SIZ=1e7;
const LL inf=1e17;
void solve(){
    int n;
    cin>>n;
    string a,b;
    cin>>a>>b;
    bool a1=all_of(all(a),[](char c){return c=='#';});
    bool b1=all_of(all(b),[](char c){return c=='#';});
    if(a1&&b1){
        cout<<"Yes\n";
        for(int i=0;i<7;i++)cout<<string(n,'#')<<'\n';
        return;
    }
    if(a1||b1){
        cout<<"No"<<'\n';
        return;
    }
    cout<<"Yes\n";
    auto calc=[&](const string& a)->pair<string,string>{
        string r1=a;
        for(char& c:r1){
            if(c=='.')c='#';
            else c='.';
        }

        int cc=0;
        for(int i=0;i<n-1;i++){
            if(r1[i]=='.'&&r1[i+1]=='#'){
                cc=i;
                break;
            }
            if(r1[i]=='#'&&r1[i+1]=='.'){
                cc=i+1;
                break;
            }
        }
        string r2(n,'.');
        r2[cc]='#';
        return {r1,r2};
    };
    vector<string> mat(7);
    mat[0]=a;
    mat[6]=b;
    auto r1=calc(a);
    mat[1]=r1.first;
    mat[2]=r1.second;
    r1=calc(b);
    mat[5]=r1.first;
    mat[4]=r1.second;
    int c1=mat[2].find('#');
    int c2=mat[4].find('#');
    mat[3]=string(n,'.');
    if(c1==c2){
        mat[3][c1]='#';
    }else{
        if(c1>c2)swap(c1,c2);
        fill(mat[3].begin()+c1+1,mat[3].begin()+c2,'#');
        if(c1+1==c2){
            mat[3][c2]='#';
        }
    }
    for(auto& s:mat)cout<<s<<'\n';
}
signed main(){
    IOS;
    int _;
    cin>>_;
    while(_--)solve();
}