#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
#define int long long
#define lc (p << 1)
#define rc (p << 1 | 1)
using namespace std;
typedef pair<int, int> PII;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 5, M = 1e6 + 5, INF = 0x3f3f3f3f, mod = 998244353;

int T = 1, n;
char s[10][N];

void work(int l, int r, int i, int j) {
	for (int k = l; k <= r; k++) {
		if (s[i][k] == '.') s[j][k] = '#';
		else s[j][k] = '.';
	}
}

void init() {
	for (int i = 2; i <= 6; i++)
		for (int j = 1; j <= n; j++) s[i][j] = '.';
}


void solve() {
	
	cin >> n; init();
	
	for (int i = 1; i <= n; i++) cin >> s[1][i];
	for (int i = 1; i <= n; i++) cin >> s[7][i];
	
	bool ok1 = true, ok2 =true;
	for (int i = 1; i <= n; i++) {
		if (s[1][i] == '.') ok1 = false;
		if (s[7][i] == '.') ok2 = false;
	}
	
	if (ok1 != ok2) {
		cout << "No" << endl;
		return ;
	} else if (ok1) {
		cout << "Yes" << endl;
		for (int i = 1; i <= 7; i++) {
			for (int j = 1; j <= n; j++) cout << s[1][j];
			cout << endl;
		}
		return ;
	}
	
	cout << "Yes" << endl;
	
	work(1, n, 1, 2);
	work(1, n, 7, 6);
	
	int l = -1, r = -1;
	for (int i = 1; i <= n && l == -1; i++) {
		if (s[2][i] == '#') continue;
		if (i > 1 && s[2][i - 1] == '#') l = i;
		if (i < n && s[2][i + 1] == '#') l = i;
	}
	
	for (int i = 1; i <= n && r == -1; i++) {
		if (s[6][i] == '#') continue;
		if (i > 1 && s[6][i - 1] == '#') r = i;
		if (i < n && s[6][i + 1] == '#') r = i;
	}
	
	s[3][l] = s[5][r] = '#';
	if (l > r) swap(l, r);
	
	if (r - l <= 1) s[4][l] = '#';
	else {
		for (int i = l + 1; i < r; i++)
			s[4][i] = '#';
	}
	
	for (int i = 1; i <= 7; i++) {
		for (int j = 1; j <= n; j++) cout << s[i][j];
		cout << endl;
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> T;
	while (T--) solve();
}