#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll Ha = 998244353;

int n;
ll b[5006], c[5005];

ll ksm(ll x, int k) {
    ll ret = 1;
    for (; k; k >>= 1, x = x * x % Ha)
        if (k & 1) ret = ret * x % Ha;
    return ret;
}

void solve() {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%lld", &b[i]);
    for (int i = 0; i < n; i++) scanf("%lld", &c[i]);
    
    vector<vector<ll>> a(n, vector<ll>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) a[i][j] = b[i] ^ c[j];
    }
    ll det = 1;
    for (int i = 0; i < n; i++) {
        int k = i;
        for (int j = i + 1; j < n; j++)
            if (a[j][i] > a[k][i]) k = j;
        if (a[k][i] == 0) {
            det = 0;
            break;
        }
        swap(a[i], a[k]);
        if (i != k) {
            det = (-det % Ha + Ha) % Ha;
        }
        det = det * a[i][i] % Ha;
        for (int j = i + 1; j < n; j++) {
            a[i][j] = a[i][j] * ksm(a[i][i], Ha - 2) % Ha;
        }
        for (int j = 0; j < n; j++) {
            if (j != i && a[j][i] != 0) {
                for (int f = i + 1; f < n; f++) {
                    a[j][f] -= a[i][f] * a[j][i] % Ha;
                    a[j][f] = (a[j][f] % Ha + Ha) % Ha;
                }
            }
        }
    }

    printf("%lld\n", det);
}


int main() {
    int ttt;
    scanf("%d", &ttt);
    while (ttt--) {
        solve();
    }
    return 0;
}