// Author: Shawn Das Shachin-->(shawn_das)

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define mod 1000000007
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define OPTIMIZE_IO ios::sync_with_stdio(false); cin.tie(nullptr);

void solve()
{
  int n;
  cin>>n;
  string s,p;
  cin>>s>>p;
  if(n==1){
    if(s==p)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
  }
  else{
    int has1=false,has0=false;
    for(int i=0; i<n; i++){
        if(p[i]=='1'){
            has1=true;
        }
        else{
            has0=true;
        }
    }
    if(has1 && has0){
        cout<<"YES"<<endl;

    }
    else{
        if(s==p){
            cout<<"yes"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
  }
}

int main()
{
    OPTIMIZE_IO;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}