//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		string s,t;
		cin>>n>>s>>t;
		string f(n,'#');
		if(s==f&&t==f)
		{
			cout<<"Yes\n";
			for(int i=1;i<=7;i++)
				cout<<f<<'\n';
			continue;
		}
		if(s==f||t==f)
		{
			cout<<"No\n";
			continue;
		}
		cout<<"Yes\n";
		cout<<s<<'\n';
		for(int i=0;i<n;i++)
			cout<<(char)('.'+'#'-s[i]);
		cout<<'\n';
		int p1=-1;
		for(int i=0;i<n;i++)
			if(s[i]=='#'&&((i&&s[i-1]=='.')||(i<n-1&&s[i+1]=='.')))
			{
				p1=i;
				break;
			}
		for(int i=0;i<n;i++)
			cout<<(char)(i==p1?'#':'.');
		cout<<'\n';
		int p2=-1;
		for(int i=0;i<n;i++)
			if(t[i]=='#'&&((i&&t[i-1]=='.')||(i<n-1&&t[i+1]=='.')))
			{
				p2=i;
				break;
			}
		if(p1==p2)
		{
			int p3=p1-1;
			if(p3==-1) p3=1;
			for(int i=0;i<n;i++)
				cout<<(char)(i==p3?'#':'.');
			cout<<'\n';
		}
		else
		{
			int fl=0;
			if(p1>p2)
			{
				swap(p1,p2);
				fl=1;
			}
			if(p1+1==p2)
			{
				for(int i=0;i<n;i++)
					cout<<(char)(i==p1?'#':'.');
				cout<<'\n';
			}
			else
			{
				for(int i=0;i<n;i++)
					cout<<(char)((i>p1&&i<p2)?'#':'.');
				cout<<'\n';
			}
			if(fl) swap(p1,p2);
		}
		for(int i=0;i<n;i++)
			cout<<(char)(i==p2?'#':'.');
		cout<<'\n';
		for(int i=0;i<n;i++)
			cout<<(char)('.'+'#'-t[i]);
		cout<<'\n';
		cout<<t<<'\n';
	}
	return 0;
}