#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

int n;
string s[7];
int cnt[7];

void f(string &b, string &a) {
    for (int i = 0; i < n; i++) {
        if (a[i] == '#') continue;
        b[i] = '#';
    }
}
int g(string &b, string &a) {
    for (int i = 0; i < n; i++) {
        if (a[i] == '#') continue;
        if (i - 1 >= 0 && a[i - 1] == '#') b[i] = '#';
        if (i + 1 < n && a[i + 1] == '#') b[i] = '#';
        if (b[i] == '#') return i;
    }
    return -1;
}
void solve() {
    cin >> n;
    cin >> s[0];
    cin >> s[6];
    cnt[0] = cnt[6] = 0;
    for (int i = 0; i < n; i++) {
        if (s[0][i] == '#') cnt[0]++;
        if (s[6][i] == '#') cnt[6]++;
    }
    if (cnt[0] == n || cnt[6] == n) {
        if (cnt[0] == n && cnt[6] == n) {
            cout << "Yes" << endl;
            for (int i = 0; i < 7; i++) cout << s[0] << endl;
        }
        else {
            cout << "No" << endl;
        }
        return;
    }
    for (int i = 1; i < 6; i++) {
        s[i].assign(n, '.');
    }
    f(s[1], s[0]);
    f(s[5], s[6]);
    int x = g(s[2], s[1]);
    int y = g(s[4], s[5]);
    if (x == y) {
        if (x == 0) s[3][1] = '#';
        else s[3][x - 1] = '#';
    }
    else {
        if (x > y) swap(x, y);
        if (x + 1 == y) s[3][x] = '#';
        else {
            for (int i = x + 1; i < y; i++) s[3][i] = '#';
        }
    }
    cout << "Yes" << endl;
    for (int i = 0; i < 7; i++) cout << s[i] << endl;
}

int main(){
    fastio;
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}