#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 10, INF = 1e18, MOD = 1e9 + 7;
typedef pair<int, int> PII;
typedef unsigned long long ull;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
int arr[N], brr[N];
map<int,int> mp;
map<PII,int> mpp;
vector<PII> vi, g[N];
vector<int> ans;
bool st[N];
int n, m, k;
void print(string s){
	for(int i = 1; i <= n; i ++) cout << s[i];
	cout << "\n";
}
void solve()
{
	cin >> n;
	string t1, t2, t3, t4, t5, t6, t7;
	cin >> t1 >> t7;
	if(((int)t1.find('.') != -1) ^ ((int)t7.find('.') != -1)){
		cout << "NO\n";
		return;
	}else if(((int)t1.find('.') == -1) && ((int)t7.find('.') == -1)){
		cout << "YES\n";
		for(int i = 0; i < 7; i ++) cout << t1 << "\n";
		return;
	}
	for(int i = 0; i <= n + 1; i ++){
		if(i == 0 || i == n + 1) t2 += " ";
		else t2 += '.';
	}
	t3 = t4 = t5 = t6 = t2;
	
	for(int i = 0; i < n; i ++){
		if(t1[i] == '.') t2[i + 1] = '#';
		if(t7[i] == '.') t6[i + 1] = '#';
	}
	int l = 0, r = 0;
	for(int i = 1; i <= n; i ++){
		if(t2[i] == '#'){
			if(t2[i - 1] =='.'){
				t3[i - 1] = '#';
				l = i - 1;
				break;
			}else if(t2[i + 1] == '.'){
				t3[i + 1] = '#';
				l = i + 1;
				break;
			}
		}
	}
	for(int i = 1; i <= n; i ++){
		if(t6[i] == '#'){
			if(t6[i - 1] =='.'){
				t5[i - 1] = '#';
				r = i - 1;
				break;
			}else if(t6[i + 1] == '.'){
				t5[i + 1] = '#';
				r = i + 1;
				break;
			}
		}
	}
	if(l > r) swap(l, r);
	for(int i = l + 1; i < r; i ++){
		t4[i] = '#';
	}
	if(r - l <= 1) t4[l] = '#';
	cout << "YES\n"<< t1 << "\n";
	print(t2);
	print(t3);
	print(t4);
	print(t5);
	print(t6);
	cout << t7 << "\n";
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T = 1;
	cin >> T;
	while (T --)	solve();
	return 0;
}