#include <cstdio>
using namespace std;
const int N = 100;
const int S = 5e4;
const int mod = 998244353;
const int inv = 499122177;
int n,s[N + 5],p[N + 5],sum,isum,ans;
int fr[N + 5][(S << 1) + 5],gr[N + 5][(S << 1) + 5];
int *f[N + 5],*g[N + 5];
inline int fpow(int a,int b)
{
    int ret = 1;
    for(;b;b >>= 1)
        (b & 1) && (ret = (long long)ret * a % mod),a = (long long)a * a % mod;
    return ret;
}
int main()
{
    scanf("%d",&n);
    for(register int i = 1;i <= n;++i)
        scanf("%d",s + i),s[i] = s[i] ? mod - 1 : 1;
    for(register int i = 1;i <= n;++i)
        scanf("%d",p + i),sum += p[i];
    for(register int i = 0;i <= n;++i)
        f[i] = fr[i] + S,g[i] = gr[i] + S;
    f[0][0] = g[0][0] = 1;
    for(register int i = 1;i <= n;++i)
        for(register int j = -sum;j <= sum;++j)
            j + p[i] <= sum && (f[i][j + p[i]] = (f[i][j + p[i]] + (long long)f[i - 1][j] * inv) % mod,g[i][j + p[i]] = (g[i][j + p[i]] + (long long)g[i - 1][j] * inv) % mod),
            j - p[i] >= -sum && (f[i][j - p[i]] = (f[i][j - p[i]] + (long long)s[i] * f[i - 1][j] % mod * inv) % mod,g[i][j - p[i]] = (g[i][j - p[i]] + (long long)g[i - 1][j] * inv) % mod);
    isum = fpow(sum,mod - 2);
    for(register int i = -sum;i < sum;++i)
        ans = (ans + ((long long)f[n][i] * g[n][sum] % mod - (long long)f[n][sum] * g[n][i] % mod + mod) * sum % mod * fpow((i - sum + mod) % mod,mod - 2)) % mod;
    ans = (long long)ans * fpow(g[n][sum],mod - 3) % mod;
    printf("%d\n",ans);
}