//code by Emissary
#include<bits/stdc++.h>

#define vc vector
#define db double
#define fi first
#define se second
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

//#define OccDreamer
//#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(int x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(int x){write(x), putchar(32);}
	inline void eprint(int x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 505;
const int mod = 998244353;

int fac[MAXN*30], ifac[MAXN*30], inv[MAXN*30], T;
int n, m, a[MAXN*30], b[MAXN*30], x[MAXN*30], y[MAXN*30], c[MAXN*30];

int G[MAXN*30], F[MAXN*30], xx[MAXN*30], now;

struct matrix{
	ll a[MAXN][MAXN];	
	inline int det(int n){
		ll ans=1, times=1;
		for(int i=1;i<=n;++i){
			for(int j=i+1;j<=n;++j){
				while(a[i][i]){
					int d=a[j][i]/a[i][i];
					if(d){
						for(int p=i;p<=n;++p) a[j][p]-=d*a[i][p], a[j][p]=(a[j][p]%mod+mod)%mod;
					}
					swap(a[i],a[j]), times*=-1;
				}
				swap(a[i],a[j]), times*=-1;
			}
			ans=ans*a[i][i]%mod;
		}
		if(times==-1) ans=mod-ans;
		return ans%mod;	
	}
}A, B;

struct poly{
	vc<int> p;
	bool vis[202*33];
	int res[202*33];
	inline int val(int x){
		if(vis[x]) return res[x]; vis[x]=1;
		int s=0, t=p.size(), ans=0;
		for(int i=t-1;i>=0;--i) ans=1ll*ans*x%mod+p[i], ans%=mod;
		return res[x]=ans;
	}
}D[202];

inline ll Quickpow(ll x, ll y){
	ll z=1;
	while(y){
		if(y&1) z=z*x%mod;
		x=x*x%mod; y>>=1;
	}
	return z;
}

inline void prework(int lim){
	fac[0]=ifac[0]=1;
	for(int i=1;i<=lim;++i) fac[i]=1ll*fac[i-1]*i%mod, ifac[i]=Quickpow(fac[i],mod-2);
	return ;
}	

signed main(){
	n=read(); prework(402*30);
	for(int i=1;i<=n;++i) a[i]=read(), T-=a[i];
	for(int i=1;i<=n;++i) b[i]=read(), T+=b[i];
	if(T&1) return eprint(0), 0; T>>=1;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j) if((a[i]<a[j])!=(b[i]<b[j])) return eprint(0), 0;
	for(int i=0;i<=200;++i){
		int o=i>>1;
		D[i].p.resize(o+1);
		for(int j=0;j<=o;++j) D[i].p[j]=1ll*ifac[j]*ifac[i-2*j]%mod;	
	}
	D[201].p.pb(0);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			if(b[j]<a[i]) B.a[i][j]=201;
			else B.a[i][j]=b[j]-a[i];
	for(int i=1;i<=202*n;++i){
		for(int j=1;j<=n;++j)
			for(int k=1;k<=n;++k) A.a[j][k]=D[B.a[j][k]].val(i);
		//cerr << "ok" << i << endl;
		x[i]=i, y[i]=A.det(n);
	}
	now=0; G[0]=1; int ans=0;
	for(int i=1;i<=202*n;++i){
		for(int j=now+1;j>=1;--j) G[j]=(1ll*G[j-1]-1ll*x[i]*G[j]%mod+mod)%mod;	
		G[0]=1ll*G[0]*(mod-x[i])%mod; ++now;
	}
	inv[0]=1;
	for(int i=1;i<=202*n;++i) inv[i]=Quickpow(i,mod-2);
	for(int i=1;i<=202*n;++i){
		//cerr << "ok:" << i << endl;
		int w=1;
		for(int j=1;j<=202*n;++j){
			if(i==j) continue;
			w=1ll*w*(x[i]-x[j]+mod)%mod;
		}
		w=1ll*Quickpow(w,mod-2)*y[i]%mod;
		for(int j=0;j<=now;++j) F[j]=G[j];
		F[0]=1ll*F[0]*Quickpow(mod-x[i],mod-2)%mod;
		for(int j=1;j<=now;++j) F[j]=1ll*(F[j-1]-F[j]+mod)%mod*inv[x[i]]%mod;
		
		for(int j=0;j<now;++j) xx[j]+=1ll*w*F[j]%mod, xx[j]%=mod;
	}
	for(int i=0;i<=202*n;++i)
		if(i<=T) ans+=1ll*xx[i]*fac[2*(T-i)]%mod*fac[T]%mod*ifac[T-i]%mod*Quickpow(mod-1,i)%mod, ans%=mod;	
	eprint(1ll*ans*Quickpow((mod+1)>>1,T)%mod);
	return 0;
}