#include<cstdio>
#include<cmath>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<ctype.h>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<list>
#define pi 4*atan(1)
#define eps 1e-10
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FF(i,n) for(int i = 0 ; i < n ; i++)
#define F(i,n) for(int i = 1 ; i <= n ; i++)
#define maxn 100000+10
#define mod 200907
#define met(a) memset(a,0,sizeof(a))
typedef long long LL;
//typedef __int64 LL;
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int len;
        cin>>len;
        char a[110],b[110];
        cin>>a>>b;
        bool flag=true;
        FF(i,len)
        {
            if(a[i]=='A')
            {
                if(b[i]!='U')flag=false;
            }
            else if(a[i]=='T')
            {
                if(b[i]!='A')flag=false;
            }
            else if(a[i]=='C')
            {
                if(b[i]!='G')flag=false;
            }
            else if(a[i]=='G')
            {
                if(b[i]!='C')flag=false;
            }
            if(!flag)break;
        }
        if(flag)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}