#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i=a; i<=b; i++)
#define per(i, b, a) for(int i=b; i>=a; i--)
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define f first
#define s second
#define nl '\n'
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef pair<int, int> pii;
#define nl '\n'

typedef long long ll;

template <ll Mod>
struct ModInt {
  ll n;

  ModInt(const ll x = 0) : n(x) {
    while (n < 0) n += Mod;
    n %= Mod;
  }
  explicit operator int() const { return n; }
  inline ModInt operator+(const ModInt r) const noexcept { return ModInt(*this) += r; }
  inline ModInt operator-(const ModInt r) const noexcept { return ModInt(*this) -= r; }
  inline ModInt operator*(const ModInt r) const noexcept { return ModInt(*this) *= r; }
  inline ModInt operator/(const ModInt r) const noexcept { return ModInt(*this) /= r; }
  inline ModInt &operator+=(const ModInt r) noexcept {
    n += r.n;
    if (n >= Mod) n -= Mod;
    return *this;
  }
  inline ModInt &operator-=(const ModInt r) noexcept {
    if (n < r.n) n += Mod;
    n -= r.n;
    return *this;
  }
  inline ModInt &operator*=(const ModInt r) noexcept {
    n = n * r.n % Mod;
    return *this;
  }
  inline ModInt &operator/=(const ModInt r) noexcept { return *this *= r.inv(); }

  inline ModInt pow(ll x) const noexcept {
    ModInt<Mod> ret(1), tmp(*this);
    while (x) {
      if (x&1) ret *= tmp;
      tmp *= tmp;
      x >>= 1;
    }
    return ret;
  }
  inline ModInt inv() const noexcept { return pow(Mod-2); }

  friend ostream& operator<<(ostream& os, const ModInt& obj) { return os << obj.n; }
  friend istream& operator>>(istream& is, ModInt& obj) {
    ll t;
    is >> t;
    obj = ModInt(t);
    return is;
  }
};
const ll mod = 998244353; //check!
using mi = ModInt<mod>;
mi operator"" _mi(unsigned long long n) { return mi(n); }

int t, n;
const int N=5000;
mi c[N][N];

signed main(){
  cin.tie(0)->sync_with_stdio(0);

  cin >> t;
  while(t--){
    cin >> n;
    vector<ll> a(n), b(n);
    for(ll &x:a) cin >> x;
    for(ll &x:b) cin >> x;

    if(n>61){
      cout << "0\n";
      continue;
    }

    for(int i=0; i<n; i++){
      for(int j=0; j<n; j++){
        c[i][j]=a[i]^b[j];
      }
    }
    
    mi det=1;
    for(int i=0; i<n; i++){
      int k=i;
      while(k<n && !int(c[k][i])) k++;
      if(k==n){
        det=0;
        break;
      }
      // cout << "k " << k << " " << c[k][i] << nl;
      if(k!=i) det=mi(-1)*det;
      swap(c[k], c[i]);
      det*=c[i][i];
      k=i;
      while(++k<n){
        for(int j=n-1; j>=i; j--) c[k][j]-=c[i][j]/c[i][i]*c[k][i];
      }
    }
    cout << det << nl;
  }
}