#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int T,n,u,d;
int a[maxn][10];
void Print(int x){
	if (x) putchar('#');
	 else putchar('.');
} 
int main(){
	scanf("%d",&T);
	while (T--){
		scanf("%d",&n); int cnt1=0,cnt2=0;
		for (int i=1; i<=n; i++){
			char ch=getchar();
			while (ch!='#'&&ch!='.') ch=getchar();
			a[i][1]=(ch=='#'); cnt1+=a[i][1];
		}
		for (int i=1; i<=n; i++){
			char ch=getchar();
			while (ch!='#'&&ch!='.') ch=getchar();
			a[i][7]=(ch=='#'); cnt2+=a[i][7];
		}
		if (cnt1==n||cnt2==n){
			if (cnt1==n&&cnt2==n){
				printf("Yes\n");
				for (int i=1; i<=7; i++){
					for (int j=1; j<=n; j++) Print(1);
					putchar(10);
				}
			} else printf("No\n");
			continue;
		}
		for (int i=1; i<=n; i++) a[i][2]=1-a[i][1],a[i][6]=1-a[i][7],a[i][3]=a[i][4]=a[i][5]=0;
		if (a[1][2]==1){
			int now=1;
			while (now<=n&&a[now][2]==1) a[now][2]=0,now++;
			a[now-1][2]=1; a[now-1][3]=1; u=now-1;
		} else{
			int now=1;
			while (now<=n&&a[now][2]==0) now++;
			a[now-1][3]=1; u=now-1;
		}
		if (a[1][6]==1){
			int now=1;
			while (now<=n&&a[now][6]==1) a[now][6]=0,now++;
			a[now-1][6]=1; a[now-1][5]=1; d=now-1;
		} else{
			int now=1;
			while (now<=n&&a[now][6]==0) now++;
			a[now-1][5]=1; d=now-1;
		}
		if (abs(d-u)<=1){
			a[d][4]=1;
		} else {
			int l=min(u,d),r=max(u,d);
			for (int i=l+1; i<=r-1; i++) a[i][4]=1;
		}
		printf("Yes\n");
		for (int i=1; i<=7; i++){
			for (int j=1; j<=n; j++) Print(a[j][i]);
			putchar(10);
		}
	}
	return 0;
}