#include <bits/stdc++.h>
using namespace std;
     
const long long mod = 10000007;
const long long INF = LLONG_MAX;
const int N = 1001000;

void solve () {
    int n, x = 0;
    string s, s1;

    cin >> n >> s >> s1;

    for (int i = 0; i < s1.length(); i++) {
        if (s1[i] == '1') {
            x++;
        }
    }
    if ((x == 0 || x == n) && s != s1) {
        cout << "NO";
    } else {
        cout << "YES";
    }
} 
int main () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); 

    long long t;
    cin >> t;

    while (t--) {
        solve();
        cout << "\n";
    }
    return 0;
}