#include<bits/stdc++.h>
using namespace std;
#define int long long
#define x first
#define y second
#define PII pair<int,int>
const int mod=998244353;
void solve() {
	int n=7,m;
	cin>>m;
	vector<vector<char>> a(n+1,vector<char>(m+1,'.'));
	int s1=0,s2=0;
	for(int j=1; j<=m; j++) cin>>a[1][j],s1+=(a[1][j]=='#');
	for(int j=1; j<=m; j++) cin>>a[7][j],s2+=(a[7][j]=='#');
	for(int j=1; j<=m; j++) a[2][j]=(a[1][j]=='#'?'.':'#');
	for(int j=1; j<=m; j++) a[6][j]=(a[7][j]=='#'?'.':'#');
	if(s1==m&&s2==m) {
		cout<<"Yes\n";
		for(int i=1; i<=n; i++) {
			for(int j=1; j<=m; j++) {
				cout<<(char)('#');
			}
			cout<<"\n";
		}
	} else if(s1==m||s2==m) {
		cout<<"No\n";
	} else {
		vector<int> l,r;
		for(int j=1; j<=m; j++) {
			if(a[2][j]=='.') {
				if(j!=1) if(a[2][j-1]=='#') l.push_back(j);
				if(j!=m) if(a[2][j+1]=='#') l.push_back(j);
			}
		}
		for(int j=1; j<=m; j++) {
			if(a[6][j]=='.') {
				if(j!=1) if(a[6][j-1]=='#') r.push_back(j);
				if(j!=m) if(a[6][j+1]=='#') r.push_back(j);
			}
		}
		int x=l[0],y=r[0];
//		cout<<x<<" "<<y<<endl;
		if(x==y) {
			a[3][x]=a[4][x]=a[5][x]='#';
		} else if(x>y) {
			if(y+1==x) {
				a[3][x]=a[4][y]=a[5][y]='#';
			} else {
				a[5][y]=a[3][x]='#';
				for(int j=y+1; j<=x-1; j++) {
					a[4][j]='#';
				}
			}
		} else if(x<y) {
			if(x+1==y) {
				a[3][x]=a[4][y]=a[5][y]='#';
			} else {
				a[5][y]=a[3][x]='#';
				for(int j=x+1; j<=y-1; j++) {
					a[4][j]='#';
				}
			}
		}
		cout<<"Yes\n";
		for(int i=1; i<=7; i++) {
			for(int j=1; j<=m; j++) {
				cout<<a[i][j];
			}
			cout<<"\n";
		}
	}
}
/*
4
4
#..#
.##.
5
##.#.
.#.##
6
######
.####.
27
.######.######.####.#.#####
.####...####..#.......#####
*/
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T=1;
	cin>>T;
	while(T--) {
		solve();
	}
}