#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<stack>
#define M 1005
using namespace std;
char A[M];
char B[M],C[M];
int main(){
    A['A']='U';A['T']='A';A['G']='C';A['C']='G';
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        scanf("%s%s",B,C);
        int ok=1;
        for(int j=0;j<n;j++){
            if(A[B[j]]!=C[j]){
                ok=0;
                break;
            }
        }
        if(ok) printf("YES\n");
        else printf("NO\n");
    }
   // system("pause");
    return 0;
}