#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using db = double;
#define endl '\n'

void solve()
{
    int n;
    cin >> n;
    string a, b;
    cin >> a >> b;
    vector<string> s(7);
    s[0] = a, s[6] = b;
    for (int i = 1; i < 6; ++i)
    {
        s[i] = string(n, '.');
    }
    if (a == string(n, '.') || b == string(n, '.'))
    {
        if (a == b)
        {
            cout << "Yes" << endl;
            for (auto x : s)
                cout << x << endl;
            return;
        }

        if (a == string(n, '.'))
        {
            for (int i = 0; i < n; ++i)
                s[5][i] = (b[i] ^ '#' ^ '.');
            cout << "Yes" << endl;
            for (auto x : s)
                cout << x << endl;
        }
        else
        {
            for (int i = 0; i < n; ++i)
                s[1][i] = (a[i] ^ '#' ^ '.');
            cout << "Yes" << endl;
            for (auto x : s)
                cout << x << endl;
        }
        return;
    }

    if (a == string(n, '#') || b == string(n, '#'))
    {
        if (a == b)
        {
            cout << "Yes" << endl;
            for (int i = 0; i < 7; ++i)
                cout << a << endl;
        }
        else
            cout << "No" << endl;
        return;
    }

    for (int i = 0; i < n; ++i)
        s[1][i] = (a[i] ^ '#' ^ '.');

    for (int i = 0; i < n; ++i)
        s[5][i] = (b[i] ^ '#' ^ '.');

    int p1 = -1, p2 = -1;
    for (int i = 0; i < n; ++i)
    {
        if (s[1][i] == '.')
        {
            if (i - 1 >= 0 && s[1][i - 1] == '#')
            {
                p1 = i;
                break;
            }
            if (i + 1 < n && s[1][i + 1] == '#')
            {
                p1 = i;
                break;
            }
        }
    }

    for (int i = 0; i < n; ++i)
    {
        if (s[5][i] == '.')
        {
            if (i - 1 >= 0 && s[5][i - 1] == '#')
            {
                p2 = i;
                break;
            }
            if (i + 1 < n && s[5][i + 1] == '#')
            {
                p2 = i;
                break;
            }
        }
    }

    s[2][p1] = '#', s[4][p2] = '#';

    if (abs(p1 - p2) <= 1)
        s[3][p1] = '#';
    else
    {
        for (int i = min(p1, p2) + 1; i < max(p1, p2); ++i)
            s[3][i] = '#';
    }
    cout << "Yes" << endl;
    for (auto x : s)
        cout << x << endl;
}

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