#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll N = 1000007;

char arr[10][N];
void solve( ){
	int n;
	cin >> n;
	string a,b;
	cin >> a>> b;
	if(b.find("#")==string::npos||a.find("#")==string::npos){
		cout<<"Yes\n";
		cout<<a<<'\n';
		for(int i=1;i<6;i++){
			for(int j=0;j<n;j++){
				cout<<'.';
			}
			cout<<'\n';
		}
		
		cout<<b<<'\n';
		return;

	}
	if(b.find(".")==string::npos||a.find(".")==string::npos){
		if(b.find(".")==string::npos&&a.find(".")==string::npos){
			cout<<"Yes\n";
			for(int i=0;i<7;i++){
				for(int i=0;i<n;i++){
					cout<<'#';
				}
				cout<<'\n';
			}
		}else{
			cout<<"No\n";
			
		}
		return;
	}

	for(int i=1;i<=n;i++){
		arr[1][i]=a[i-1];
		arr[7][i]=b[i-1];

	}
	for(int i=1;i<=n;i++){
		if(arr[1][i]=='.')arr[2][i]='#';
		else arr[2][i]='.';
		
		if(arr[7][i]=='.')arr[6][i]='#';
		else arr[6][i]='.';
		
	}
	int aa=0,bb=0;
	for(int i=1;i<n;i++){
		if(arr[2][i]=='.'&&arr[2][i+1]=='#'){
			arr[3][i]='#';
			aa=i;
			for(int j=1;j<=n;j++){
				if(j==i)continue;
				arr[3][j]='.';
			}

			break;
		}else if(arr[2][i]=='#'&&arr[2][i+1]=='.'){
			arr[3][i+1]='#';
			aa=i+1;
			for(int j=1;j<=n;j++){
				if(j==i+1)continue;
				arr[3][j]='.';
			}
			break;
		}
	}

	for(int i=1;i<n;i++){
		if(arr[6][i]=='.'&&arr[6][i+1]=='#'){
			arr[5][i]='#';
			bb=i;
			for(int j=1;j<=n;j++){
				if(j==i)continue;
				arr[5][j]='.';
			}

			break;
		}else if(arr[6][i]=='#'&&arr[6][i+1]=='.'){
			arr[5][i+1]='#';
			bb=i+1;
			for(int j=1;j<=n;j++){
				if(j==i+1)continue;
				arr[5][j]='.';
			}
			break;
		}
	}
	
	for(int i=1;i<=n;i++){
		if(i>min(aa,bb)&&i<max(aa,bb)){
			arr[4][i]='#';
		}else{
			arr[4][i]='.';
		}
		
	}
	if(aa==bb||abs(aa-bb)==1)arr[4][aa]='#';
	cout<<"Yes\n";
	for(int i=1;i<=7;i++){
		for(int j=1;j<=n;j++){
			cout<<arr[i][j];

		}
		cout<<'\n';
	}
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    ll T=1;
    cin >> T;
    while(T--){
        solve();
    }
}
/*
7
 4
 #..#
 .##.
 5
 ##.#.
 .#.##
 6
 ######
 .####.
 27
 .####...####..#.......#####
 .####...####..#.......#####
4
 ####
 ####
4
 ####
 ....
4
####
..#.


*/