#include<bits/stdc++.h>
using namespace std;   
 
const int N = 1e5 + 10, P = 13331 , M = 2e3 + 10, Mod = 998244353, INF = 0x3f3f3f3f;
const double eps = 1e-8;
 
/* #define x first
#define y second */
#define MAXN 99999999 
 
typedef unsigned long long ull; 
typedef long long ll;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;

char mp[8][N];

void Solved()
{  
   int n;
   cin >> n;
   
   for(int j = 1; j <= 7; j ++)
     for(int i = 1; i <= n; i ++)
       mp[j][i] = '.';
   
   cin >> mp[1] + 1;
   cin >> mp[7] + 1;
   
   int cnt0 = 0, cnt1 = 0;
   for(int i = 1; i <= n; i ++)
   {
      if(mp[1][i] == '#') cnt0 ++;
      else mp[2][i] = '#';
      if(mp[7][i] == '#') cnt1 ++;
      else mp[6][i] = '#';
   }

   if((cnt0 == n && cnt1 != n) || (cnt1 == n && cnt0 != n))
   {
      cout << "No" << '\n';
      return;
   }

   if(cnt0 == n)
   {
      cout << "Yes" << '\n';
      for(int i = 1; i <= 7; i ++)
      {
        for(int j = 1; j <= n; j ++)
          cout << '#';
        cout << "\n";  
      }
      return;
   }
   
   int t1 = 0, t2 = 0;
   for(int i = 1; i <= n; i ++)
   {
      if(mp[1][i] == '#' && (mp[1][i + 1] == '.' || mp[1][i - 1] == '.'))
      {
         mp[3][i] = '#';
         t1 = i;
         break;
      }
   }

   for(int i = 1; i <= n; i ++)
   {
      if(mp[7][i] == '#' && (mp[7][i + 1] == '.' || mp[7][i - 1] == '.'))
      {
         mp[5][i] = '#';
         t2 = i;
         break;
      }
   }
  
   if(abs(t1 - t2) > 1)
     for(int i = min(t1, t2) + 1; i <= max(t2, t1) - 1; i ++) mp[4][i] = '#';
   else if(t1 == t2 || abs(t1 - t2) == 1)
     mp[4][t1] = '#';   

   cout << "Yes" << "\n";
   for(int i = 1; i <= 7; i ++)
   {
      for(int j = 1; j <= n; j ++)
      {
         cout << mp[i][j];
      }
      cout << "\n";
   }
}
 
int main()
{
      
/*    ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0); */
 
   int t;
   cin >> t;
   //t = 1;
 
   while (t --)
   {
      Solved();
   }
 
   return 0;
}