#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#define ALL(v) v.begin(),v.end()
#define For(i,_) for(int i=0,i##end=_;i<i##end;++i) // [0,_)
#define FOR(i,_,__) for(int i=_,i##end=__;i<i##end;++i) // [_,__)
#define Rep(i,_) for(int i=(_)-1;i>=0;--i) // [0,_)
#define REP(i,_,__) for(int i=(__)-1,i##end=_;i>=i##end;--i) // [_,__)
typedef long long ll;
typedef unsigned long long ull;
#define V vector
#define pb push_back
#define pf push_front
#define qb pop_back
#define qf pop_front
#define eb emplace_back
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
#define fi first
#define se second
const int dir[4][2]={{-1,0},{0,1},{1,0},{0,-1}},inf=0x3f3f3f3f,mod=1e9+7;
const ll infl=0x3f3f3f3f3f3f3f3fll;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
int init=[](){return cin.tie(nullptr)->sync_with_stdio(false),0;}();
int main(){
    int t_case=1;
    scanf("%d",&t_case);
    while(t_case--){
        int n;
        scanf("%d",&n);
        V<char>a(n+1),g(n+1);
        scanf("%s%s",a.data(),g.data()),a.qb(),g.qb();
        int x=count(ALL(a),'#'),y=count(ALL(g),'#');
        assert(x&&y);
        auto print=[&](const V<char> &v){
            for(char c:v)putchar(c);
            putchar(10);
        };
        if(x==n||y==n){
            if(a==g){
                puts("Yes");
                For(_,7)print(a);
            }
            else puts("No");
            continue;
        }
        V<char>b(n,'.'),c(n,'.'),d(n,'.'),e(n,'.'),f(n,'.');
        For(i,n){
            if(a[i]=='.')b[i]='#';
            if(g[i]=='.')f[i]='#';
        }
        For(i,n)if(b[i]=='.'&&((i&&b[i-1]=='#')||(i+1<n&&b[i+1]=='#'))){
            For(j,n)if(f[j]=='.'&&((j&&f[j-1]=='#')||(j+1<n&&f[j+1]=='#'))){
                c[i]=e[j]='#';
                if(abs(i-j)<2)d[i]='#';
                else FOR(k,min(i,j)+1,max(i,j))d[k]='#';
                puts("Yes");
                print(a),print(b),print(c),print(d),print(e),print(f),print(g);
                break;
            }
            break;
        }
    }
    return 0;
}