#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;
char A[7][N];
void Solve(){
	scanf("%d",&n);
	scanf("%s",A[0]+1);
	scanf("%s",A[6]+1);
	for(int i=1;i<6;i++){
		for(int j=1;j<=n;j++) A[i][j]='.';
		A[i][n+1]=0;
	}
	int c1=count(A[0]+1,A[0]+n+1,'#'),c2=count(A[6]+1,A[6]+n+1,'#');
	if(c1==n||c2==n){
		if(c1^n||c2^n){
			puts("No");
			return;
		}
		for(int i=0;i<7;i++) for(int j=1;j<=n;j++) A[i][j]='#';
	}else{
		for(int i=1;i<=n;i++) A[1][i]=(A[0][i]=='#'?'.':'#');
		for(int i=1;i<=n;i++) A[5][i]=(A[6][i]=='#'?'.':'#');
		int i1=0,i2=0;
		for(int i=1;i<n;i++){
			if(A[0][i]^A[0][i+1]){
				i1=(A[0][i]=='#'?i:i+1);
			}
			if(A[6][i]^A[6][i+1]){
				i2=(A[6][i]=='#'?i:i+1);
			}
		}
		A[2][i1]=A[4][i2]='#';
		if(abs(i1-i2)<=1) A[3][i1]='#';
		else for(int i=min(i1,i2)+1;i<max(i1,i2);i++) A[3][i]='#'; 
	}
	puts("Yes");
	for(int i=0;i<7;i++) printf("%s\n",A[i]+1);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}