//xtqqwq
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair<int,int>PII;
template<typename T>void inline read(T&x) {
	x=0;int f=1;char s=getchar();
	while (s<'0'||s>'9') { if (s=='-') { f=-1;} s=getchar();}
	while (s>='0'&&s<='9') x=x*10+(s^48),s=getchar();
	x*=f;
}
template<typename T>bool inline chkmin(T&x,T y) { return y<x ? x=y,1 : 0;}
template<typename T>bool inline chkmax(T&x,T y) { return y>x ? x=y,1 : 0;}
const int N=105,M=50005,P=998244353;
int n,a[N],p[N],f[2][M],g[2][M],m,ans;
int inline power(int a,int b) {
	int ret=1;
	while (b) {
		if (b&1) ret=1ll*ret*a % P;
		a=1ll*a*a % P;
		b>>=1;
	}
	return ret;
}
void inline add(int&x,int y) {
	x+=y;
	if (x>=P) x-=P;
}
void inline del(int&x,int y) {
	x-=y;
	if (x<0) x+=P;
}
int main() {
	read(n);
	for (int i=1;i<=n;i++) read(a[i]);
	for (int i=1;i<=n;i++) read(p[i]),m+=p[i];
	f[0][0]=1;
	for (int i=1;i<=n;i++) {
		memcpy(g,f,sizeof g);
		memset(f,0,sizeof f);
		for (int x=0;x<=1;x++) {
			for (int y=0;y<=m;y++) {
				if (!g[x][y]) continue;
				add(f[x^a[i]][y+p[i]],g[x][y]);
				add(f[x][y],g[x][y]);
			}
		}
	}
	int I=power(m,P-2);
	for (int y=1;y<=m;y++) {
		if (!f[1][y]) continue;
		int w=P-2;
		int z=1;
		add(z,1ll*y*I % P);
		del(z,1ll*(m-y)*I % P);
		w=1ll*w*power(z,P-2) % P;
		del(ans,1ll*w*f[1][y] % P);
	}
	printf("%d\n",ans);
	return 0;
}