/*
  PROB:BC #65 t1
  TIME:
  #define me AcrossTheSky
  good good study,day day up!
*/
#include <cstdio>
#include <cmath>
#include <ctime>
#include <string>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
char a[1000],b[1000];
bool judge(char x,char y)
{
    if (x=='A' && y=='U') return true;
    if (x=='C'&& y=='G') return true;
    if (x=='G' && y== 'C') return true;
    if (x=='T' && y=='A') return true;
    return false;
}
int main(){
    int n,m;
    int cas;
    cin >> cas;
    while (cas--){
        int len;
        cin >> len;
        scanf("%s",a);
        scanf("%s",b);
        bool flag=false;
        for (int i=0;i<len;i++) if (!judge(a[i],b[i])) {flag=true; break;}
        if (!flag) cout << "YES" << endl;
        else cout << "NO" << endl; 
    }
}