#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define per(i,r,l) for(int i=r; i>=l; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;
const int mod=998244353,N=62;
ll v[N][N];
ll qp(ll x,ll y){
    ll res=1; x=(x%mod+mod)%mod;
    while(y){
        if(y&1)res=res*x%mod;
        x=x*x%mod; y>>=1;
    } return res;
}
void slv(){
    int n; cin>>n;
    vector<ll>a(n+1),b(n+1);
    rep(i,1,n)cin>>a[i];
    rep(i,1,n)cin>>b[i];
    if(n>60){
        cout<<"0\n"; return;
    }
    rep(i,1,n){
        rep(j,1,n)v[i][j]=(a[i]^b[j])%mod;
    }
    int ans=1;
    rep(i,1,n){
        rep(j,i,n){
            if(v[j][i]){
                if(j!=i)ans=-ans;
                swap(v[i],v[j]); break;
            }
        }
        if(!v[i][i]){
            cout<<"0\n";return;
        }
        ll inv=qp(v[i][i],mod-2);
        rep(j,i+1,n){
            ll t=inv*v[j][i]%mod;
            rep(k,i,n)v[j][k]=(v[j][k]-t*v[i][k])%mod;
        }
        ans=ans*v[i][i]%mod;
    }
    cout<<(ans%mod+mod)%mod<<'\n';
}
int main() {
    IOS
    int T;cin>>T;
    while(T--)slv();
    return 0;
}