#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 1e2 + 5;
const int MAXM = (1 << 8) + 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;
}

#define bbit(i) (1<<(i))
#define bdig(x,i) (((x)>>(i))&1)

inline void fwt(int a[], int n) {
    for (int k = 1; k < n; k <<= 1)
        for (int i = 0; i < n; i += k << 1)
            for (int j = i; j < i + k; ++j) {
                int tmp = a[j + k];
                add_mod(a[j + k] = a[j], mod - tmp);
                add_mod(a[j], tmp);
            }
}

int s[MAXN], p[MAXN];

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);
        sump = pw(sump, mod - 2);

        for (int i = 1; i <= n; ++i)
            p[i] = (ll)p[i] * sump % mod;
    }

    static int fp[MAXM];

    for (int i = 1; i <= n; ++i)
        fp[bbit(i - 1)] = p[i];

    fwt(fp, 1 << n);
    //  for(int i=0; i<(1<<n); ++i)
    //      printf("fp: %d\n",fp[i]);

    static int fbeg[MAXM];
    int begmask = 0;

    for (int i = 1; i <= n; ++i)
        if (s[i])
            begmask |= bbit(i - 1);

    fbeg[begmask] = 1;
    fwt(fbeg, 1 << n);
    //  for(int i=0; i<(1<<n); ++i)
    //      printf("fbeg: %d\n",fbeg[i]);

    int m = (1 << n) + 1;
    static int a[MAXM][MAXM];
    auto chk = [&](int b[], int i) {
        if (!a[i][i] || !b[i])
            return;

        ll t = mod - b[i];

        for (int j = i; j <= m; ++j)
            b[j] = (b[j] + t * a[i][j]) % mod;
    };
    auto insert = [&](int b[]) {
        //      printf("insert: ");
        //      for(int i=0; i<=m; ++i) printf("%d ",b[i]);
        //      printf("\n");
        for (int i = 0; i < m; ++i)
            if (b[i]) {
                if (a[i][i]) {
                    chk(b, i);
                    continue;
                }

                ll t = pw(b[i], mod - 2);

                for (int j = i; j <= m; ++j)
                    b[j] = b[j] * t % mod;

                memcpy(a[i], b, (m + 1) << 2);

                for (int j = i + 1; j < m; ++j)
                    chk(a[i], j);

                for (int j = 0; j < i; ++j)
                    chk(a[j], i);

                return;
            }

        //      printf("fail\n");
    };

    static int b[MAXM];
    b[1 << n] = (mod - (1 << n) % mod) % mod;

    for (int mask = 0; mask < (1 << n); ++mask)
        b[mask] = 1;

    insert(b);

    for (int mask = 0; mask < (1 << n); ++mask) {
        memset(b, 0, sizeof(b));
        b[mask] = (1 - fp[mask] + mod) % mod;
        b[1 << n] = fp[mask];
        b[m] = fbeg[mask];
        insert(b);
    }

    //  for(int i=0; i<m; ++i, printf("\n"))
    //      for(int j=0; j<=m; ++j)
    //          printf("%d ",a[i][j]);
    //  printf("\n");

    int ans = (a[0][m] - a[1 << n][m] + mod) % mod;
    printf("%d", ans);
    return 0;
}