#include <bits/stdc++.h>
using namespace std;

void solve()
{
    int n;
    cin >> n;
    string a, b;
    cin >> a >> b;
    int cnta = count(a.begin(), a.end(), '#'), cntb = count(b.begin(), b.end(), '#');
    if (cnta == n && cntb == n) {
        cout << "Yes\n";
        for (int i = 0; i < 7; i++) cout << a << "\n";
        return;
    }
    if (cnta == n || cntb == n) {
        cout << "No\n";
        return;
    }
    vector<vector<int>> mp(8, vector<int>(n + 1));
    for (int i = 0; i < n; i++) {
        mp[1][i + 1] = a[i] == '#';
        mp[7][i + 1] = b[i] == '#';
    }
    for (int i = 1; i <= n; i++) {
        mp[2][i] = mp[1][i] != 1;
    }
    for (int i = 1; i <= n; i++) {
        mp[6][i] = mp[7][i] != 1;
    }
    int p, q;
    for (int i = 1; i <= n; i++) {
        if (mp[2][i] != 1 && (mp[2][i - 1] || mp[2][i + 1])) {
            mp[3][i] = 1;
            p = i;
            break;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (mp[6][i] != 1 && (mp[6][i - 1] || mp[6][i + 1])) {
            mp[5][i] = 1;
            q = i;
            break;
        }
    }

    if (p == q || abs(p - q) == 1) {
        mp[4][p] = 1;
    }
    else {
        for (int i = min(p, q) + 1; i <= max(p, q) - 1; i++) {
            mp[4][i] = 1;
        }
    }

    cout << "Yes\n";
    for (int i = 1; i <= 7; i++) {
        for (int j = 1; j <= n; j++) {
            cout << (mp[i][j] ? '#' : '.');
        }
        cout << "\n";
    }
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int tt;
    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}