#include <stdio.h>
#include <string.h>
#include <assert.h>

#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long double LDB;

typedef long long LL;
constexpr int N = 100005;
constexpr int mod = 998244353;

int n;
char a[N], b[N];

void simp(char *a) {
	for (int i = 0; i < n; ++i) {
		a[i] = (a[i] == '#');
	}
}

bool chkAll(char *a) {
	for (int i = 0; i < n; ++i) {
		if (!a[i]) {
			return false;
		}
	}
	return true;
}

int getp(char *a) {
	for (int i = 1; i < n; ++i) {
		if (a[i] != a[i - 1]) {
			if (a[i]) {
				return i;
			}
			return i - 1;
		}
	}
	assert(0);
}

void outline(int x, int y) {
	if (x > y) {
		swap(x, y);
	}
	if (y - x < 2) {
		for (int i = 0; i < n; ++i) {
			putchar(".#"[i == x]);
		}
	} else {
		for (int i = 0; i < n; ++i) {
			putchar(".#"[x < i && i < y]);
		}
	}
	puts("");
}

void solve() {
	scanf("%d%s%s", &n, a, b);
	simp(a), simp(b);
	bool fa = chkAll(a), fb = chkAll(b);
	if (fa && fb) {
		puts("Yes");
		for (int i = 0; i < 7; ++i) {
			for (int j = 0; j < n; ++j) {
				putchar('#');
			}
			puts("");
		}
		return;
	}
	if (fa || fb) {
		puts("No");
		return;
	}
	puts("Yes");
	for (int i = 0; i < n; ++i) {
		putchar(".#"[a[i]]);
	}
	puts("");
	for (int i = 0; i < n; ++i) {
		putchar(".#"[!a[i]]);
	}
	puts("");
	int pa = getp(a), pb = getp(b);
	for (int i = 0; i < n; ++i) {
		putchar(".#"[i == pa]);
	}
	puts("");
	outline(pa, pb);
	for (int i = 0; i < n; ++i) {
		putchar(".#"[i == pb]);
	}
	puts("");
	for (int i = 0; i < n; ++i) {
		putchar(".#"[!b[i]]);
	}
	puts("");
	for (int i = 0; i < n; ++i) {
		putchar(".#"[b[i]]);
	}
	puts("");
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		solve();
	}
	return 0;
}