#include<bits/stdc++.h>
using namespace std;
#define mod 998244353
inline void fmod(int &x)
{
    if(x>=mod)x-=mod;
    return ;
}
inline int qread()
{
    int a=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
    return a*f;
}
inline int qpow(long long x,int y)
{
    long long cx=1;
    while(y)
    {
        (y&1)&&((cx*=x)%=mod);
        (x*=x)%=mod;
        y>>=1;
    }
    return cx;
}
int n,t,ans,a[40],b[40],jc[10010],fac[10010],Y[10010],sum,LGV[40][40],A[10010],B[10010];
map<int,int>mp[210];
inline int det()
{
    int an=1;
    for(int i=1,inv;i<=n;++i)
    {
    	if(!LGV[i][i])
    	{
    		for(int j=i+1;j<=n;++j)if(LGV[j][i]){swap(LGV[j],LGV[i]);break;}
    		an=mod-an;
		}
        inv=qpow(LGV[i][i],mod-2);
        for(int j=i+1,x;j<=n;++j)
        {
            x=1ll*inv*LGV[j][i]%mod;x=mod-x;
            for(int k=i;k<=n;++k)LGV[j][k]=(1ll*LGV[j][k]+1ll*x*LGV[i][k])%mod;
        }
    }
    for(int i=1;i<=n;++i)an=1ll*an*LGV[i][i]%mod;
    return an;
}
inline int solve(int x)
{
    for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)
    {
        LGV[i][j]=0;
        for(int k=0,X=1;k<=(b[j]-a[i])>>1;++k,X=1ll*X*x%mod)
        {
            LGV[i][j]=(1ll*LGV[i][j]+1ll*fac[k]*fac[b[j]-a[i]-(k<<1)]%mod*X)%mod;
        }
    }
    return det();
}
inline int get_inv(int x){return 1ll*fac[x]*jc[x-1]%mod;}
int main()
{
    n=qread();jc[0]=fac[0]=sum=1;
    for(int i=1;i<=n;++i)a[i]=qread();
    for(int i=1;i<=n;++i)sum+=(b[i]=qread()),mp[a[i]][b[i]]=1;
    sort(a+1,a+1+n);sort(b+1,b+1+n);
    for(int i=1;i<=sum;++i)jc[i]=1ll*jc[i-1]*i%mod;
    fac[sum]=qpow(jc[sum],mod-2);
    for(int i=sum;i;--i)fac[i-1]=1ll*fac[i]*i%mod;
    for(int i=1;i<=sum;++i)
	{
		Y[i]=solve(i);
		for(int j=1;j<i;++j)Y[i]=1ll*Y[i]*get_inv(i-j)%mod;
		for(int j=i+1;j<=sum;++j)Y[i]=1ll*Y[i]*(mod-get_inv(j-i))%mod;
	}
	B[0]=1;
    for(int i=1;i<=sum;++i)
    {
    	for(int j=i-1;~j;--j)A[j]=(1ll*A[j]*(mod-i)+1ll*Y[i]*B[j]+(j?A[j-1]:0))%mod;
    	for(int j=i;~j;--j)B[j]=(1ll*B[j]*(mod-i)+(j?B[j-1]:0))%mod;
	}
    for(int i=1;i<=n;++i)
    {
        t+=(b[i]-a[i]);
        if(!mp[a[i]][b[i]])return puts("0"),0;
    }
    if(t&1)return puts("0"),0;
    t>>=1;
    for(int i=0;i<=t;++i)ans=(1ll*ans+1ll*(i&1?mod-1:1)*jc[(t-i)<<1]%mod*fac[t-i]%mod*A[i])%mod;
    ans=1ll*ans*jc[t]%mod*qpow(qpow(2,mod-2),t)%mod;
	printf("%d\n",ans);
    return 0;
}