#include<bits/stdc++.h>
using namespace std;
int _;
bool solve() {
int n; cin >> n;
vector<vector<int>> a(2, vector<int>(n));
for(auto &p : a) for(int &pp : p) {
char in; cin >> in;
pp=(in<='2' ? 0 : 1);
}
int dir=1, r=0, c=0;
while(r>=0 && c>=0 && r<2 && c<n) {
if(a[r][c]) {
if(dir==0 || dir==2) dir=1, c++;
else dir=2-2*r, r^=1;
} else {
if(dir==1) c++;
else return 0;
}
}
return r && c==n;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> _;
while(_--) cout << (solve() ? "YES\n" : "NO\n");
return 0;
}
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |