#include<bits/stdc++.h>
#define ll long long
using namespace std;
void rd(){}
template<typename T,typename... U> void rd(T &x,U&... arg){
	x=0;int f=1,c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-48,c=getchar();
	x*=f;rd(arg...);
}
const int maxn=6005,P=998244353;
ll fpow(ll n,ll x){ll s=1;while(x){if(x&1) s=s*n%P;x>>=1,n=n*n%P;}return s;}
int N,NM,a[35],b[35],mp[205];
ll fac[maxn],inv[maxn],y[maxn],A[maxn],B[maxn];
struct Matrix{
	ll a[35][35];int n;
	Matrix(int n=0):n(n){memset(a,0,sizeof a);}
	ll *operator[](int i){return a[i];}
	ll det(){
		static ll b[35][35];
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				b[i][j]=a[i][j];
		ll ans=1;
		for(int i=1;i<=n;i++)
			for(int j=i;j<=n;j++){
				if(!b[j][i]) continue;
				swap(b[i],b[j]);
				if(i!=j) ans=P-ans;
				for(j=i+1;j<=n;j++){
					ll mul=b[j][i]*fpow(b[i][i],P-2)%P;
					for(int k=i;k<=n;k++) (b[j][k]+=(P-mul)*b[i][k]%P)%=P; 
				}
			}
		for(int i=1;i<=n;i++) ans=ans*b[i][i]%P;
		return ans;
	} 
};
int main(){
//	freopen("transform3.in","r",stdin);
//	freopen("transform.out","w",stdout);
	fac[0]=1;for(int i=1;i<maxn;i++) fac[i]=fac[i-1]*i%P;
	inv[maxn-1]=fpow(fac[maxn-1],P-2);for(int i=maxn-2;~i;i--) inv[i]=inv[i+1]*(i+1)%P;
	rd(N);
	for(int i=1;i<=N;i++) rd(a[i]);
	bool flag=0;
	for(int i=1;i<=N;i++) rd(b[i]),NM+=b[i]-a[i],flag|=a[i]>b[i];
	flag|=NM&1;
	for(int i=1;i<=N;i++) mp[a[i]]=b[i];
	sort(a+1,a+N+1);
	sort(b+1,b+N+1);
	for(int i=1;i<=N;i++) flag|=mp[a[i]]!=b[i];
	if(flag) return puts("0"),0;
	for(int i=1;i<=NM/2+1;i++){
		Matrix m(N);
		for(int j=1;j<=N;j++)
			for(int k=1;k<=N;k++)
				for(int o=0,pw=1;o<=(b[k]-a[j])/2;o++,pw=(int)(1LL*pw*(P-i)%P))
					(m[j][k]+=inv[o]*inv[b[k]-a[j]-2*o]%P*pw%P)%=P;
		y[i]=m.det();
		y[i]=y[i]*inv[i-1]%P*inv[NM/2+1-i]%P;
		if((NM/2+1-i)&1) y[i]=P-y[i];
	}
	B[0]=1;
	for(int i=1;i<=NM/2+1;i++){
		for(int j=i-1;~j;j--) A[j]=(B[j]*y[i]+A[j]*(P-i)+(j?A[j-1]:0))%P;
		for(int j=i;~j;j--) B[j]=(B[j]*(P-i)+(j?B[j-1]:0))%P;
	}
	ll ans=0;
	for(int i=0;i<=NM/2;i++) (ans+=fac[NM-2*i]*inv[NM/2-i]%P*A[i]%P)%=P;
	ans=ans*fac[NM/2]%P*fpow((P+1)/2,NM/2)%P;
	printf("%lld",ans);
	return 0;
}