// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define ull unsigned long long
//#define int long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define mod 998244353
struct modint{
	unsigned int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x<o.x?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n;
char s[maxn],t[maxn],mp[9][maxn];

void work()
{
	n=read();
	cin>>(mp[1]+1)>>(mp[7]+1);
	int s1=0,s2=0;
	For(i,1,n)s1+=(mp[1][i]=='#'),s2+=(mp[7][i]=='#');
	if((s1==n && s2<n) || (s2==n&&s1<n)){
		puts("No");
		return;
	}
	puts("Yes");
	if(s1==n && s2==n){
		For(i,1,7) cout<<(mp[1]+1)<<"\n";
		return;
	}
	int p2=0,p6=0;
	For(i,1,n){
		mp[2][i]=mp[1][i]^'#'^'.';
		mp[6][i]=mp[7][i]^'#'^'.';
		mp[3][i]=mp[4][i]=mp[5][i]='.';
	}
	For(i,1,7) mp[i][n+1]=mp[i][0]=0;
	For(i,1,n){
		if(mp[2][i]=='.' && ((i>1 && mp[2][i-1]=='#') || (i<n && mp[2][i+1]=='#'))) p2=i;
		if(mp[6][i]=='.' && ((i>1 && mp[6][i-1]=='#') || (i<n && mp[6][i+1]=='#'))) p6=i;
	}
	mp[3][p2]=mp[5][p6]='#';
	if(p2==p6 || p2==p6+1 || p6==p2+1){
		mp[4][p2]='#';
	}else{
		For(i,min(p2,p6)+1,max(p2,p6)-1)
			mp[4][i]='#';
	}
	For(i,1,7) cout<<(mp[i]+1)<<"\n";
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}
/*

*/