codeforces 1234C（思维）

#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=2*1e5+10;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
string s[2];
void solve(){
    int n;cin>>n;
    rep(i,0,2) cin>>s[i];
    bool flag=true;
    int pos=0,h=0;
    while(1){
        if(pos==n) break;
        if(s[h][pos]=='1' || s[h][pos]=='2'){
            pos++;
        }else{
            if(s[(h+1)%2][pos]!='1' && s[(h+1)%2][pos]!='2'){
                pos++;
                h=(h+1)%2;
            }else{
                flag=false;
                break;
            }
        }
    }
    if(flag && pos==n && h==1) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}
int main(){
    IOS;
    int t;cin>>t;
    while(t--){
        solve();
    }
    return 0;
}