// Author: kyEEcccccc

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using ULL = unsigned long long;

#define F(i, l, r) for (int i = (l); i <= (r); ++i)
#define FF(i, r, l) for (int i = (r); i >= (l); --i)
#define MAX(a, b) ((a) = max(a, b))
#define MIN(a, b) ((a) = min(a, b))
#define SZ(a) ((int)((a).size()) - 1)

constexpr int N = 100005, M = 512, MOD = 998244353;

LL kpow(LL x, LL k = MOD - 2)
{
	x %= MOD;
	LL r = 1;
	while (k)
	{
		if (k & 1) r = r * x % MOD;
		x = x * x % MOD;
		k >>= 1;
	}
	return r;
}

int n;
int a[N], b[N];
LL sum[M][M];
LL fac[M], ifac[M];
LL f[M][M];
bool ok[M];

signed main(void)
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0), cin.tie(nullptr);

	cin >> n;
	F(i, 1, n) cin >> a[i];
	F(i, 1, n) cin >> b[i];

	fac[0] = 1;
	F(i, 1, M - 1) fac[i] = fac[i - 1] * i % MOD;
	ifac[M - 1] = kpow(fac[M - 1]);
	FF(i, M - 1, 1) ifac[i - 1] = ifac[i] * i % MOD;

	F(i, 1, n)
	{
		sum[b[i]][0] += 1;
		ok[b[i]] = true;
		LL cur = 1;
		F(j, 1, M - 1)
		{
			(cur *= a[i]) %= MOD;
			sum[b[i]][j] += cur;
		}
	}

	F(i, 0, M - 1)
	{
		if (!ok[i]) continue;
		F(j, 0, M - 1)
		{
			if (!ok[j]) continue;
			F(k, 0, M - 1) F(l, 0, M - 1 - k)
				(f[i ^ j][k + l] += sum[i][k] * sum[j][l] % MOD * ifac[k] % MOD * ifac[l]) %= MOD;
		}
	}
	LL ans = 0;
	F(i, 0, M - 1) F(j, 0, M - 1) F(k, 0, i ^ j)
		(ans += f[i][k] * f[j][(i ^ j) - k] % MOD * fac[i ^ j]) %= MOD;
	cout << ans << endl;
	
	return 0;
}