#include <bits/stdc++.h>
#define endl '\n'
#define int long long
// #define i128 __int128
using namespace std;
typedef long long ll;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;

int n;
char mp[10][N];

void solve(){
	cin>>n;
	int cnt=0;
	for(int i=2;i<=6;i++){
    	for(int j=1;j<=n;j++){
    		mp[i][j]='.';
    	}
    }
    bool sg1=false,sg2=false;
    for(int i=1;i<=n;i++){
    	cin>>mp[1][i];
    	if(mp[1][i]=='.'){
    		mp[2][i]='#';
    		cnt++;
    	}
    }
    if(cnt==0)
    	sg1=true;
    cnt=0;
    for(int i=1;i<=n;i++){
    	cin>>mp[7][i];
    	if(mp[7][i]=='.'){
    		mp[6][i]='#';
    		cnt++;
    	}
    }
    if(cnt==0)
    	sg2=true;
    if(sg1^sg2){
    	cout<<"NO"<<endl;
    	return;
    }
    cout<<"YES"<<endl;
    if(sg1&&sg2){
    	for(int i=1;i<=7;i++){
    		for(int j=1;j<=n;j++){
    			cout<<mp[1][j];
    		}
    		cout<<endl;
    	}
    }else{
    	int pos1,pos2;
    	for(int i=1;i<=n;i++){
    		if(mp[2][i]=='.'){
    			if(i>=2&&mp[2][i-1]=='#'){
    				pos1=i;
    				break;
    			}else if(i<=n-1&&mp[2][i+1]=='#'){
    				pos1=i;
    				break;
    			}
    		}
    	}
    	for(int i=1;i<=n;i++){
    		if(mp[6][i]=='.'){
    			if(i>=2&&mp[6][i-1]=='#'){
    				pos2=i;
    				break;
    			}else if(i<=n-1&&mp[6][i+1]=='#'){
    				pos2=i;
    				break;
    			}
    		}
    	}
    	mp[3][pos1]='#';
    	mp[5][pos2]='#';
    	if(pos1==pos2){
    		mp[4][pos1]='#';
    	}else if(abs(pos1-pos2)==1){
    		mp[4][pos1]='#';
    	}else{
    		for(int i=min(pos1,pos2)+1;i<max(pos1,pos2);i++){
    			mp[4][i]='#';
    		}
    	}
    	for(int i=1;i<=7;i++){
    		for(int j=1;j<=n;j++){
    			cout<<mp[i][j];
    		}
    		cout<<endl;
    	}
    }
    return;
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    // cout<<setiosflags(ios::fixed)<<setprecision(1);
    int T=1;cin>>T;
    while(T--){
        solve();
    }
    return 0;
}