#include <bits/stdc++.h>
// #define int long long
#define debug cout << "------------------------------" << endl

using namespace std;

void solve() {
    int n;
    string a, b;
    cin >> n >> a >> b;
    int na = count(a.begin(), a.end(), '#');
    int nb = count(b.begin(), b.end(), '#');
    vector<string> ans(7);

    auto print = [&]() -> void {
        cout << "Yes\n";
        for (auto i : ans) {
            for (auto c : i) {
                cout << c;
            }
            cout << '\n';
        }
    };

    if (na == n || nb == n) {
        if (na == nb) {
            for (auto &i : ans)
                i = a;
            print();
            return;
        } else {
            cout << "No\n";
            return;
        }
    }
    ans[0] = a;
    ans[6] = b;
    for (int i = 0; i < n; ++i) {
        ans[1].push_back(ans[0][i] == '#' ? '.' : '#');
        ans[5].push_back(ans[6][i] == '#' ? '.' : '#');
    }
    auto work = [&](int x, int d) -> int {
        int pos = -1;
        ans[d] = string(n, '.');
        for (int i = 0, ok = true; i < n && ok; ++i) {
            if (i > 0) {
                if (ans[x][i - 1] == '#' && ans[x][i] == '.') {
                    ok = false;
                    pos = i;
                    ans[d][i] = '#';
                }
            } else if (i + 1 < n) {
                if (ans[x][i + 1] == '#' && ans[x][i] == '.') {
                    ok = false;
                    pos = i;
                    ans[d][i] = '#';
                }
            }
        }
        return pos;
    };
    int pos1 = work(1, 2);
    int pos2 = work(5, 4);
    ans[3] = string(n, '.');
    bool ok = false;
    if (pos1 == -1 || pos2 == -1) {
        vector<vector<int>> mle;
        while (true) {
            mle.push_back(vector<int>(1000000));
        }
    }
    for (int i = min(pos1, pos2) + 1; i < max(pos1, pos2); ++i) {
        ans[3][i] = '#';
        ok = true;
    }
    if (!ok) {
        ans[3][pos1] = '#';
    }
    print();
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}