#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
char s[10][100005];

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

void solve() {
    cin >> n;
    init();
    cin >> (s[1] + 1);
    // s[1] = " " + s[1];
    cin >> (s[7] + 1);
    // s[7] = " " + s[7];

    int cnt1 = 0;
    int cnt7 = 0;
    for (int i = 1; i <= n; i++) {
        cnt1 += s[1][i] == '#';
        cnt7 += s[7][i] == '#';
    }
    if ((cnt1 == n && cnt7 != n) || (cnt1 != n && cnt7 == n)) {
        cout << "No" << '\n';
        return;
    }
    if (cnt1 == n && cnt7 == n) {
        cout << "Yes" << '\n';
        for (int i = 1; i <= 7; i++) {
            for (int j = 1; j <= n; j++) {
                cout << '#';
            }
            cout << '\n';
        }
        return;
    }

    for (int i = 1; i <= n; i++) {
        if (s[1][i] == '#') {
            s[2][i] = '.';
        } else {
            s[2][i] = '#';
        }
        if (s[7][i] == '#') {
            s[6][i] = '.';
        } else {
            s[6][i] = '#';
        }
    }
    int y1 = 0, y2 = 0;
    for (int i = 1; i <= n; i++) {
        if (s[2][i] == '#' && i >= 2 && s[2][i - 1] != '#') {
            y1 = i - 1;
            break;
        }
        if (s[2][i] == '#' && i <= n - 1 && s[2][i + 1] != '#') {
            y1 = i + 1;
            break;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (s[6][i] == '#' && i >= 2 && s[6][i - 1] != '#') {
            y2 = i - 1;
            break;
        }
        if (s[6][i] == '#' && i <= n - 1 && s[6][i + 1] != '#') {
            y2 = i + 1;
            break;
        }
    }

    s[3][y1] = '#';
    s[5][y2] = '#';
    if (y1 == y2) {
        s[4][y1] = '#';
    } else if (abs(y1 - y2) == 1) {
        s[4][y1] = '#';
    } else {
        for (int i = min(y1, y2) + 1; i <= max(y1, y2) - 1; i++) {
            s[4][i] = '#';
        }
    }
    cout << "Yes\n";
    for (int i = 1; i <= 7; i++) {
        for (int j = 1; j <= n; j++) {
            cout << s[i][j];
        }
        cout << '\n';
    }
}

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

    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}