#include<bits/stdc++.h>

using namespace std;

#define int long long 
#define se second
#define fi first 
#define endl '\n'
const int N = 1e5 + 10;
int a[10][N];
void solve(){
	int n;
	cin>>n;
	for(int i = 1; i <= 7;i ++){
		for(int j = 0;j <= n + 1;j ++) a[i][j] = 0;
	}
	string s1,s2;
	cin>>s1>>s2;
	int p1 = 0,p2 = 0;
	s1 = " " + s1;
	s2 = " " + s2;
	for(int i = 1;i <= n;i ++){
		if(s1[i] == '.'){
			p1 = 1;
			a[1][i] = 0;
		}
		else a[1][i] = 1;
		if(s2[i] == '.') {
			p2 = 1;
			a[7][i] = 0;
		}
		else a[7][i] = 1;
	}
	if(p1 == 0 && p2 == 0){
		cout<<"Yes"<<endl;
		for(int i = 1;i <= 7;i ++){
			for(int j = 1;j <= n;j ++) cout<<"#";
			cout<<endl;
		}
		return ;
	}
	if(p1 == 0 || p2 == 0){
		cout<<"No"<<endl;
		return ;
	} 
	for(int i = 1;i <= n;i ++) {
		if(a[1][i] == 0) a[2][i] = 1;
		if(a[7][i] == 0) a[6][i] = 1;
	}
	int pos1 = 0,pos2 = 0;
	for(int i = 1;i <= n;i ++){
		if(a[2][i] == 0 && (a[2][i - 1] == 1 || a[2][i + 1] == 1)){
			a[3][i] = 1;
			pos1 = i;
			break;
		}
	}
	for(int i = 1;i <= n;i ++){
		if(a[6][i] == 0 && (a[6][i - 1] == 1 || a[6][i + 1] == 1) ){
			a[5][i] = 1;
			pos2 = i;
			break;
		}
	}
//	cout<<pos1<<" "<<pos2<<endl;
	if(pos1 > pos2) swap(pos1,pos2);
	if(pos1 == pos2){
		a[4][pos1] = 1;
	}
	else if(pos1 + 1 == pos2){
		a[4][pos1] = 1;
	}
	else{
		for(int i = min(pos1,pos2) + 1;i < max(pos1,pos2);i ++){
			a[4][i] = 1;
		}
	}
	cout<<"Yes"<<endl;
	for(int i = 1; i <= 7;i ++){
		for(int j = 1;j <= n;j ++) {
			if(a[i][j] == 0) cout<<".";
			else cout<<"#";
		}
		cout<<endl;
	}
	
	
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	solve();
	return 0;
}