#include<cstdio>
#include<utility>
#define _MAXN 100010
int n,T,L[2]={1,7};
char s[8][_MAXN];
inline char rev(char x) {return '#'+'.'-x;}
bool check()
{
	bool f[2]={1};
	for (int h:{0,1})
		for (int i=1;i<=n;i++)
			if (!(f[h]=(s[L[h]][i]=='#'))) break;
	if (f[0]^f[1]) std::printf("No\n");
		else std::printf("Yes\n");
	if (f[0]&&f[1])
		for (int i=1;i<=7;i++) std::printf("%s\n",s[1]+1);
	return !(f[0]||f[1]);
}
void init()
{
	for (int i=2;i<=6;i++)
	{
		for (int j=1;j<=n;j++) s[i][j]='.';
		s[i][n+1]='\0';
	}
	return;
}
int process(int a,int b,int c)
{
	for (int i=1;i<=n;i++)
		s[b][i]=rev(s[a][i]);
	int xx=0;
	for (int i=1;i<n;i++)
	{
		if (s[b][i]=='#' && s[b][i+1]=='.') {s[c][xx=i+1]='#';break;}
		if (s[b][i]=='.' && s[b][i+1]=='#') {s[c][xx=i]='#';break;}
	}
	return xx;
}
void processmid(int x,int y)
{
	if (x>y) std::swap(x,y);
	if (y<=x+1) s[4][x]='#';
	else for(int i=x+1;i<y;i++) s[4][i]='#';
	return;
}
int main()
{
	std::scanf("%d",&T);
	while (T--)
	{
		std::scanf("%d%s%s",&n,1[s]+1,7[s]+1);
		if (!check()) continue;
		init();
		processmid(process(1,2,3),process(7,6,5));
		for (int i=1;i<=7;i++) std::printf("%s\n",s[i]+1);
	}
	return 0; 
}
/*#include<cstdio>
#include<utility>
#define _MAXN 100010
int n,T,L[2]={1,7};
char s[8][_MAXN];
inline char rev(char x) {return '#'+'.'-x;}
bool check()
{
	bool f[2]={1};
	for (int h:{0,1})
		for (int i=1;i<=n;i++)
			if (!(f[h]=(s[L[h]][i]=='#'))) break;
	if (f[0]^f[1]) std::printf("No\n");
		else std::printf("Yes\n");
	if (f[0]&&f[1])
		for (int i=1;i<=7;i++) std::printf("%s\n",s[1]+1);
	return !(f[0]||f[1]);
}
void init()
{
	for (int i=2;i<=6;i++)
	{
		for (int j=1;j<=n;j++) s[i][j]='.';
		s[i][n+1]='\0';
	}
	return;
}
int process(int a,int b,int c)
{
	for (int i=1;i<=n;i++)
		s[b][i]=rev(s[a][i]);
	int xx=0;
	for (int i=1;i<n;i++)
	{
		if (s[b][i]=='#' && s[b][i+1]=='.') {s[c][xx=i+1]='#';break;}
		if (s[b][i]=='.' && s[b][i+1]=='#') {s[c][xx=i]='#';break;}
	}
	return 0; 
}*/