// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 515, MOD = 998244353, inv2 = (MOD + 1) >> 1;
int n, a[N], b[N], c[N][N], d[N * 2][N], e[N * 4][N], ans;
inline void add(int &x, ll y) {x = (x + y) % MOD;}
inline int power(int x, int y = MOD - 2) {
	int ans = 1;
	for (; y; x = (ll) x * x % MOD, y >>= 1)
		if (y & 1) ans = (ll) ans * x % MOD;
	return ans;
}
void fwt(int *a, int f) {
	for (int len = 2, t = 1; len <= 512; len <<= 1, t <<= 1)
		for (int i = 0; i < 512; i += len)
			F(j, i, i + t - 1) {
				int x = a[j], y = a[j + t];
				a[j] = (x + y) % MOD;
				a[j + t] = (x - y + MOD) % MOD;
				if (f == -1) a[j] = (ll) a[j] * inv2 % MOD, a[j + t] = (ll) a[j + t] * inv2 % MOD;
			}
}
signed main() {
	read(n);
	F(i, 1, n) read(a[i]);
	F(i, 1, n) read(b[i]), c[a[i]][b[i]]++;
	F(i, 1, 500) fwt(c[i], 1);
	F(i, 1, 500)
		F(j, 1, 500)
			F(k, 0, 511)
				add(d[i + j][k], (ll) c[i][k] * c[j][k]);
	F(i, 1, 1000)
		F(j, 1, 1000)
			F(k, 0, 511)
				add(e[i + j][k], (ll) d[i][k] * d[j][k]);
	F(i, 1, 2000) {
		fwt(e[i], -1);
		F(j, 0, 511) add(ans, (ll) e[i][j] * power(i, j));
	}
	cout << ans;
	return 0;
}
/* why?
*/