#include <bits/stdc++.h>

#define ll long long

void solve(){
	int n;
	std::string a, b;
	std::cin >> n >> a >> b;

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

	std::cout << "Yes\n";

	std::vector<std::string> ans(7, std::string(n, '.'));
	ans[0] = a, ans[6] = b;

	for (int i = 0; i < n; i++){
		if (a[i] == '#') {
			ans[1][i] = '.';
		}else{
			ans[1][i] = '#';
		}
		if (b[i] == '#') {
			ans[5][i] = '.';
		}else{
			ans[5][i] = '#';
		}
	}

	int posa = -1, posb = -1;

	for (int i = 0; i < n && posa == -1; i++){
		if (ans[1][i] == '.'){
			if (i && ans[1][i - 1] == '#'){
				posa = i;
			}
			if (i < n - 1 && ans[1][i + 1] == '#'){
				posa = i;
			}
		}
	}
	for (int i = 0; i < n && posb == -1; i++){
		if (ans[5][i] == '.'){
			if (i && ans[5][i - 1] == '#'){
				posb = i;
			}
			if (i < n - 1 && ans[5][i + 1] == '#'){
				posb = i;
			}
		}
	}
	assert(!(posa == -1 && posb == -1));
	if (posa == -1 || posb == -1){
		std::cout << "No\n";
		return;
	}

	ans[2][posa] = '#';
	ans[4][posb] = '#';
	if (posa > posb){
		std::swap(posa, posb);
	}
	if (posb - posa <= 1){
		ans[3][posa] = '#';
	}else{
		for (int i = posa + 1; i < posb; i++){
			ans[3][i] = '#';
		}
	}
	assert(ans[0] == a && ans[6] == b);
	for (int i = 0; i < 7; i++){
		std::cout << ans[i] << '\n';
	}

}

int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t;

	std::cin >> t;

	while (t--){
		solve();
	}

	return 0;
}