// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=(a);i<=(b);i++)
#define dF(i,a,b) for(int i=(a);i>=(b);i--)
#define wh(lzm) while(lzm--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
using namespace std;
ll read(){
	ll x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353,maxn=500005;
inline int qpow(int x,ll y){
	int rt=1;
	for(;y;y>>=1,x=1ll*x*x%mod) if(y&1) rt=1ll*rt*x%mod;
	return rt;
}
inline void inc(int &x,int y){ x=(x+y>=mod)?(x+y-mod):(x+y); }
inline void dec(int &x,int y){ x=(x>=y)?(x-y):(x+mod-y); }
inline void mul(int &x,int y){ x=1ll*x*y%mod; }
inline int add(int x,int y){ return (x+y>=mod)?(x+y-mod):(x+y); }
inline int sub(int x,int y){ return (x>=y)?(x-y):(x+mod-y); }
inline int prod(int x,int y){ return 1ll*x*y%mod; }
inline void chkmax(int &x,int y){ x=max(x,y); }
inline void chkmin(int &x,int y){ x=min(x,y); }
// inline void chkmax(ll &x,ll y){ x=max(x,y); }
// inline void chkmin(ll &x,ll y){ x=min(x,y); }
inline int mypow(int x,int y,int Mod){
	x%=Mod; int rt=1;
	for(;y;y>>=1,x=(1ll*x*x)%Mod) if(y&1) rt=(1ll*rt*x)%Mod;
	return rt;
}
mt19937 rng(time(0));
inline int rd(int l,int r){ return rng()%(r-l+1)+l; }
// mt19937 eng(std::chrono::steady_clock::now().time_since_epoch().count());
// int rd(int l,int r) { return std::uniform_int_distribution<int>(l,r)(eng); }
namespace combi{
	int fac[maxn],ifac[maxn],inv[maxn];
	void init(int N){
		fac[0]=ifac[0]=inv[0]=1;
		F(i,1,N) fac[i]=1ll*fac[i-1]*i%mod;
		ifac[N]=qpow(fac[N],mod-2);
		dF(i,N-1,1) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
		F(i,1,N) inv[i]=1ll*ifac[i]*fac[i-1]%mod;
	}
	inline int C(int n,int m){
		if(m>n||n<0||m<0) return 0;
		return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
	}
}
using namespace combi;
pii a[35];
int n,m,mat[35][35],pw[205];
int det(int n){
	int ans=1;
	F(i,1,n) F(j,i+1,n){
    	for(;mat[i][i];){
     	 	const int d=mat[j][i]/mat[i][i];
        	F(k,i,n) mat[j][k]=(mat[j][k]-1ll*d*mat[i][k]%mod+mod)%mod;
        	swap(mat[i],mat[j]),ans=mod-ans;
    	}
    	swap(mat[i],mat[j]),ans=mod-ans;
	}
	F(i,1,n) mul(ans,mat[i][i]);
	return ans;
}
vector<int>mul_x(vector<int>a,int t){// a*=(1+tx)
	a.push_back(0);
	dF(i,(int)a.size()-1,1) a[i]=add(a[i-1],1ll*t*a[i]%mod);
	mul(a[0],t);
	return a;
}
vector<int>div_x(vector<int>a,int t){// a/=(1+tx)
	vector<int>c((int)a.size()-1);
	dF(i,(int)a.size()-1,1) c[i-1]=a[i],dec(a[i-1],1ll*t*a[i]%mod);
	return c;
}
vector<int>operator+(vector<int>a,vector<int>b){
	F(i,0,(int)a.size()-1) inc(a[i],b[i]);
	return a;
}
vector<int>operator*(vector<int>a,int t){
	for(int &i:a)mul(i,t);
	return a;
}
void solve(){
	n=read(),init(maxn-3);
	F(i,1,n)a[i].fi=read();
	F(i,1,n)a[i].se=read();
	sort(a+1,a+n+1);
	F(i,1,n)if(a[i-1].se>a[i].se||a[i].fi>a[i].se)return puts("0"),void();
	F(i,1,n)m+=a[i].se-a[i].fi;
	if(m&1)return puts("0"),void();
	m>>=1;
	vector<int>vec;
	F(i,0,m){
		pw[0]=1;
		F(j,1,200)pw[j]=1ll*pw[j-1]*i%mod;
		F(j,1,n)F(k,1,n){
			mat[j][k]=0;
			const int d=a[k].second-a[j].first;
			F(l,0,d>>1) inc(mat[j][k],1ll*pw[l]*ifac[l]%mod*ifac[d-(l<<1)]%mod);
		}
		vec.push_back(det(n));
	}
  	vector<int>P(m+1,0),tmp(1,1);
  	F(i,0,m) tmp=mul_x(tmp,mod-i);
  	F(i,0,m){
  		int coef=1;
  		F(j,0,m)if(i^j)mul(coef,sub(i,j));
  		P=P+div_x(tmp,mod-i)*(1ll*vec[i]*qpow(coef,mod-2)%mod);
  	}
  	int ans=0;
  	F(i,0,m){
  		int val=1ll*fac[m]*fac[(m-i)<<1]%mod*ifac[m-i]%mod*P[i]%mod;
  		if(i&1)dec(ans,val);
  		else inc(ans,val);
  	}
  	mul(ans,qpow(qpow(2,m),mod-2));
  	printf("%d",ans);
}
signed main(){
	int sjy=1;
	cmh(sjy) solve();
}