#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 1e2 + 5;
const int MAXP = 5e4 + 5;
const int mod = 998244353;

inline void add_mod(int &a, int b) {
    a += b;

    if (a >= mod)
        a -= mod;
}

inline ll pw(ll a, ll b) {
    ll res = 1;

    while (b) {
        if (b & 1)
            res = res * a % mod;

        a = a * a % mod;
        b >>= 1;
    }

    return res;
}

int s[MAXN], p[MAXN];
int f[MAXP][2];

int main(void) {
    int n;
    scanf("%d", &n);

    for (int i = 1; i <= n; ++i)
        scanf("%d", &s[i]);

    for (int i = 1; i <= n; ++i)
        scanf("%d", &p[i]);

    int sump = accumulate(p + 1, p + n + 1, 0);

    f[0][0] = 1;

    for (int i = 1; i <= n; ++i)
        for (int j = sump; j >= 0; --j)
            for (int k = 0; k <= 1; ++k)
                if (f[j][k])
                    add_mod(f[j + p[i]][k ^ s[i]], f[j][k]);

    int ans = 0;

    for (int i = 0; i <= sump; ++i)
        if (f[i][1])
            ans = (ans + (ll)sump * pw(i, mod - 2) % mod * f[i][1]) % mod;

    printf("%d", ans);
    return 0;
}