#include<iostream>#include<cstdio>#include<cmath>#include<string>#include<cstring>#include<algorithm>#include<limits>#include<vector>#include<stack>#include<queue>#include<set>#include<map>usingnamespace std;typedeflonglong ll;constint maxN =2e5+7;constint maxM =2e6;int n;char s[2][maxN];intmain(){int q;scanf("%d",&q);while(q --){scanf("%d",&n);for(int i =0; i <2; i ++){scanf("%s", s[i]);}int row =0, line =0, dir =0;bool flag =false;while(line < n){if(dir ==0)//方向为右{if(s[row][line]<='2')//往右走{
line ++;}else//往上下走{
dir =1;
row =!row;}}else//方向为上下{if(s[row][line]<='2'){
flag =true;break;}else//往右走{
dir =0;
line ++;}}}if(flag || row ==0)printf("NO\n");elseprintf("YES\n");}return0;}