#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define no cout<<"No"<<"\n"
#define yes cout<<"Yes"<<"\n"
constexpr int mod=998244353;
constexpr int N=2e5+30;
void work(){
int n;
cin>>n;
vector<int> a(n);
vector<int> b(n);
for(int i=0;i<n;++i){
cin>>a[i];
}
for(int i=0;i<n;++i){
cin>>b[i];
}
vector<bool> v(3,false);
int cnt=0;
for(int i=0;i<n;++i){
if(a[i]==0&&b[i]==0) continue;
while(a[i]%2==0&&b[i]%2==0){
a[i]/=2,b[i]/=2;
}
if(a[i]%2==1&&b[i]%2==0) v[0]=true;
else if(a[i]%2==0&&b[i]%2==1) v[1]=true;
else v[2]=true;
}
for(int i=0;i<3;++i) cnt+=(v[i]==true);
cout<<(cnt<=1?"Yes":"No")<<"\n";
return ;
}
signed main(){
IOS;
int TT;
cin>>TT;
while(TT--)
work();
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |