#include <bits/stdc++.h>
#define fst first
#define snd second
using namespace std;
typedef long long ll;
const int mod = 998244353;
const int N = 5010;
int n;
ll b[N], c[N];
ll a[N][N];

int ksm(int x, int y = mod - 2) {
	int w = 1;
	for(; y; y >>= 1, x = 1ll * x * x % mod) if(y & 1) w = 1ll * w * x % mod;
	return w;
}
void solve1() {
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			a[i][j] = (b[i] ^ c[j]) % mod;
	int res = 1;
	for(int i = 1; i <= n; i++) {
		int k = i;
		for(int j = i; j <= n; j++)
			if(a[j][i] != 0) {
				k = j; break;
			}
		if(k != i) swap(a[i], a[k]), res = (mod - res) % mod;
		int inv = ksm(a[i][i]);
		res = 1ll * res * a[i][i] % mod;
		for(int j = i; j <= n; j++) a[i][j] = 1ll * a[i][j] * inv % mod;
		for(int j = i + 1; j <= n; j++)
			if(a[j][i]) {
				int mu = a[j][i];
				for(int h = 1; h <= n; h++)
					a[j][h] = (a[j][h] - 1ll * mu * a[i][h] % mod + mod) % mod;
			}
	}
	for(int i = 1; i <= n; i++) res = 1ll * res * a[i][i] % mod;
	cout << res << "\n";
}
void solve() {
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> b[i];
	for(int i = 1; i <= n; i++) cin >> c[i];
	if(n <= 120) {
		solve1(); return ;
	}
	cout << "0\n";
}
int main() {
//	freopen("D.in", "r", stdin);
	ios::sync_with_stdio(0); cin.tie(nullptr);
	int T; cin >> T;
	for(; T; --T) solve();
	return 0;
}