#include <bits/stdc++.h>

using i64 = int64_t;

constexpr int MOD = 998244353;

int qpow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = (i64)res * a % MOD;
        a = (i64)a * a % MOD, b >>= 1;
    }
    return res;
}

void solve() {
    int n;
    std::cin >> n;

    std::vector<i64> b(n), c(n);
    for (int i = 0; i < n; ++i) std::cin >> b[i];
    for (int i = 0; i < n; ++i) std::cin >> c[i];

    if (n > 120) {
        std::cout << "0\n";
        return;
    }

    std::vector<std::vector<int>> a(n, std::vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j)
            a[i][j] = (b[i] ^ c[j]) % MOD;
    }

    bool flag = false;
    int ans = 1;
    for (int i = 0; i < n; ++i) {
        int p = i;
        while (p < n && a[p][i] == 0) ++p;
        if (p == n) {
            std::cout << "0\n";
            return;
        }
        if (p != i) {
            std::swap(a[p], a[i]);
            flag ^= 1;
        }

        int inv = qpow(a[i][i], MOD - 2);
        ans = (i64)ans * a[i][i] % MOD;
        for (int j = i; j < n; ++j) a[i][j] = (i64)a[i][j] * inv % MOD;

        for (int j = i + 1; j < n; ++j) {
            int f = a[j][i];
            if (!f) continue;
            for (int k = i; k < n; ++k) {
                a[j][k] = (a[j][k] - (i64)a[i][k] * f) % MOD;
            }
        }
    }

    if (flag) ans = -ans;
    ans = (ans + MOD) % MOD;
    std::cout << ans << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
}