#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;

char a[10][N];

void solve() {
    int n;
    cin >> n;

    for (int i = 1;i < 10;i++) {
        for (int j = 0;j <= n;j++) {
            a[i][j] = '.';
        }
    }

    for (int i = 1;i <= n;i++)cin >> a[1][i];
    for (int i = 1;i <= n;i++)cin >> a[7][i];

    for (int i = 1;i <= n;i++) {
        a[2][i] = (a[1][i] == '.') ? '#' : '.';
        a[6][i] = (a[7][i] == '.') ? '#' : '.';
    }

    int l = -1, r = -1;
    for (int i = 2;i <= n;i++) {
        if (a[2][i] == '.' && a[2][i - 1] == '#')l = i;
        if (a[6][i] == '.' && a[6][i - 1] == '#')r = i;
    }

    for (int i = 1;i < n;i++) {
        if (a[2][i] == '.' && a[2][i + 1] == '#')l = i;
        if (a[6][i] == '.' && a[6][i + 1] == '#')r = i;
    }

    //cout << l << " " << r << "\n";
    
    if (l == -1 && r == -1) {
        for (int i = 2;i <= 6;i++) {
            for (int j = 1;j <= n;j++) {
                a[i][j] = '#';
            }
        }
    }
    else if (l == -1 || r == -1) {
        cout << "No\n";
        return;
    }
    else {
        a[3][l] = a[5][r] = '#';
        for (int i = min(l, r) + 1;i <= max(l, r) - 1; i++) {
            a[4][i] = '#';
        }
        if (abs(r - l) <= 1)a[4][l] = '#';
    }
    
    cout << "Yes\n";
    for (int i = 1;i <= 7;i++) {
        for (int j = 1;j <= n;j++) {
            cout << a[i][j];
        }
        cout << "\n";
    }
}

signed main() {
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
}