#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<cctype>
using namespace std;

#define X first
#define Y second

typedef pair<int,int> pii;
typedef long long LL;
const char nl = '\n';
const int N = 1e5+10;
const int M = 2e5+10;
int n,m;
int cnt[110];
void solve(){
	bool f = 1;
	memset(cnt,0,sizeof cnt);
	cin >> n;
	string s;
	for(int i = 1; i <= 2; i ++ ){
		cin >> s;
		for(int j = 0; j < n; j ++ ){
			if(s[j] == '1')cnt[j + 2] ++;
			if(i == 2 && cnt[j + 2] == 2){
				f = 0;
				break;
			}
		}
	}
	if(f)cout << "YES" << nl;
	else cout << "NO" << nl;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);

	int T;
	cin >> T;
	while(T --){
		solve();
	}
}