#include <iostream>
#include <map>
#include <set>
#include <array>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <random> //mt19937 mtrand(time(0));
#include <string>
#include <time.h>
#include <vector>
#include <cstring>
#include <iomanip> //fixed<<setprecision(12)<<
#include <utility> //pair模板,std::move()
#include <assert.h>
#include <algorithm>
#include <unordered_map>
#define QAQ 0
#define endl '\n'
#define close                         \
    std::ios::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const db pi = acos(-1);
const db eps = 1e-7;
const int inf = 1e9;
const ll INF = 2e18;
const int N = 1e5 + 7;
const int M = 5e6 + 7;
const int mod = 998244353;
const int base = 131;
using namespace std;
//

char a[10][N];

void solve()
{
    //	freopen("data.in.txt","r",stdin);
    //	freopen("data.out.txt","w",stdout);
    int n;
    cin >> n;
    for (int i = 1; i <= 7; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            a[i][j] = '.';
        }
    }

    int g1 = 0, g2 = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[1][i];
        if (a[1][i] == '.')
        {
            a[2][i] = '#';
            g1 = 1;
        }
        else
            a[2][i] = '.';
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> a[7][i];
        if (a[7][i] == '.')
        {
            a[6][i] = '#';
            g2 = 1;
        }
        else
            a[6][i] = '.';
    }
    if (g1 == 0 && g2 == 0)
    {
        cout << "Yes\n";
        for (int i = 1; i <= 7; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                cout << '#';
            }
            cout << "\n";
        }
        return;
    }
    else if (g1 == 0 || g2 == 0)
    {
        cout << "No\n";
        return;
    }
    int now1 = -1, now2 = -1;
    for (int i = 1; i < n; i++)
    {
        if (a[2][i] != a[2][i + 1])
        {
            if (a[2][i] == '.')
                now1 = i;
            else
                now1 = i + 1;
            break;
        }
    }
    a[3][now1] = '#';
    for (int i = 1; i < n; i++)
    {
        if (a[6][i] != a[6][i + 1])
        {
            if (a[6][i] == '.')
                now2 = i;
            else
                now2 = i + 1;
            break;
        }
    }
    a[5][now2] = '#';
    if (now1 > now2)
        swap(now1, now2);
    if (now1 == now2 || now1 + 1 == now2)
    {
        a[4][now1] = '#';
    }
    else
    {
        for (int i = now1 + 1; i < now2; i++)
        {
            a[4][i] = '#';
        }
    }
    cout << "Yes\n";
    for (int i = 1; i <= 7; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (a[i][j] == '#')
                cout << a[i][j];
            else
                cout << '.';
        }
        cout << '\n';
    }
}

signed main()
{
    close;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return QAQ;
}