/**
 * All Praise to Allah
 * ---------------------
 * Author     : Al Kayes Rifat
 * Portfolio  : alkayesrifat.netlify.app
 * Date       : 06/01/2026 (Tuesday)
 * Time       : 20:35 
 * ---------------------
 */

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>// - Use 'less<T>' for set, 'less_equal<T>' for multiset
#define ll long long int
#define ull unsigned long long
#define endl "\n"

int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int alkayesrifat ;
    cin >>  alkayesrifat ;
    while(alkayesrifat--)
    {
        int n ;
        cin >> n ;
        string s , p ;
        cin >>s >> p;

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

            if(n == 1){
                cout <<"NO" << endl;
                continue;
            }

            int poss = 1;

            for(int i = 0 ; i < n -1; i++){
                if(p[i] == '0' && p[i+1] == '0'){
                    poss = 0 ;
                }
            }
            if(poss == 1){
                cout <<"YES" << endl;
            }
            else{
                cout <<"NO" << endl;
            }

        }

    }

    return 0;
}