#include <bits/stdc++.h>
using namespace std;
#define re
#define ll long long
#define in inline
const int _ = 1e5 + 23;
char s[8][_];
int n;
in void gz(int k, int o) {
    int f = 0;
    for (int i = 1; i <= n; ++i)
        if (s[k][i] != '#') s[k + o][i] = '#';
    for (int i = 1; i <= n; ++i)
        if (((s[k + o][i + 1] == '#' && i + 1 <= n) || (s[k + o][i - 1] == '#' && i - 1 >= 1)) && s[k + o][i] != '#') {
            s[k + o + o][i] = '#';
            break;
        }
}
in void solve() {
    cin >> n;
    cin >> s[1] + 1;
    cin >> s[7] + 1;
    int f1 = 1, f2 = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 2; j <= 6; ++j) s[j][i] = '.';
        if (s[1][i] == '.') f1 = 0;
    }
    for (int i = 1; i <= n; ++i)
        if (s[7][i] == '.') f2 = 0;
    if (f1 != f2) {
        puts("No");
        return;
    }
    if (f1 & f2) {
        cout << "Yes\n";
        for (int i = 1; i <= 7; ++i) {
            for (int j = 1; j <= n; ++j) putchar('#');
            puts("");
        }
        return;
    }
    gz(1, 1), gz(7, -1);
    int a = 0, b = 0;
    for (int i = 1; i <= n; ++i) {
        if (s[3][i] == '#') a = i;
        if (s[5][i] == '#') b = i;
    }
    if (a == b)
        s[4][a] = '#';
    else {
        if (a > b) swap(a, b);
        if (a + 1 == b)
            s[4][a] = '#';
        else {
            for (int i = a + 1; i < b; ++i) s[4][i] = '#';
        }
    }
    puts("Yes");
    for (int k = 1; k <= 7; ++k) {
        for (int i = 1; i <= n; ++i) {
            putchar(s[k][i]);
            s[k][i] = '.';
        }
        puts("");
    }
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
}

/*
2
4
#..#
.##.
5
#.#.#
.#.#.



*/