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

const int N = 1e5+10;
char s[7][N];
int n;
int judge(){
    int cnt = 2;
    for(int i = 0; i < n; i++)
        if(s[0][i] == '.') {cnt--; break;}
    for(int i = 0; i < n; i++)
        if(s[6][i] == '.') {cnt--; break;}
    return cnt;
}
int main(){
    int T; scanf("%d", &T);
    while(T--){
        scanf("%d%s%s", &n, s[0], s[6]);
        if(judge() != 1){
            printf("Yes\n");
            if(judge() == 2){
                for(int i = 0; i < 7; i++) printf("%s\n", s[0]);
                continue;
            }
        }
        else {printf("No\n"); continue;}
        for(int i = 0; i < n; i++){
            if(s[0][i] == '#') s[1][i] = '.';
            else s[1][i] = '#';
            if(s[6][i] == '#') s[5][i] = '.';
            else s[5][i] = '#';
        }
        for(int i = 0; i < n; i++)
            s[2][i] = s[4][i] = '.';
        int pos1, pos2;
        for(int i = 0; i < n; i++) if(s[1][i] == '.'){
            if(i > 0 && s[1][i-1] == '#') {s[2][i] = '#'; pos1 = i; break;}
            if(i < n-1 && s[1][i+1] == '#') {s[2][i] = '#'; pos1 = i; break;}
        }
        for(int i = n-1; i >= 0; i--) if(s[5][i] == '.'){
            if(i > 0 && s[5][i-1] == '#') {s[4][i] = '#'; pos2 = i; break;}
            if(i < n-1 && s[5][i+1] == '#') {s[4][i] = '#'; pos2 = i; break;}
        }
        if(abs(pos1-pos2) == 1) strcpy(s[3], s[2]), strcpy(s[2], s[1]);
        else for(int i = 0; i < n; i++)
            if(s[2][i] == '#' || s[4][i] == '#') s[3][i] = '.';
            else s[3][i] = '#';

        for(int i = 0; i < 7; i++)
            printf("%s\n", s[i]);
        for(int i = 0; i < 7; i++)
            memset(s[i], 0, n+1);
    }
    return 0;
}