#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=6009,mod=998244353;

int n,m,a[N],b[N],fac[N],ifac[N],inv[N],p[N][N],y[N],f[N],g[N],h[N],r[N],ans;
pii u[N],v[N];

int ksm(int x,int y,int r=1) {
  for(;y;y>>=1,x=x*x%mod) if(y&1) r=r*x%mod;
  return r;
}
void init() {
  fac[0]=1; rep(i,1,6000) fac[i]=fac[i-1]*i%mod;
  ifac[6000]=ksm(fac[6000],mod-2);
  per(i,5999,0) ifac[i]=ifac[i+1]*(i+1)%mod;
  inv[0]=0; rep(i,1,6000) inv[i]=fac[i-1]*ifac[i]%mod;
}
int F(int d,int z) {
  int pw=1,res=0; if(d<0) return 0;
  rep(i,0,d/2) {
    int w=ifac[i]*ifac[d-2*i]%mod*pw%mod;
    if(i&1) res=(res+mod-w)%mod;
    else res=(res+w)%mod;
    pw=pw*z%mod;
  } return res;
}
int det(int res=1) {
  rep(i,1,n) {
    int r=i; while(r<=n&&!p[r][i]) ++r;
    if(!p[r][i]) return 0;
    if(r!=i) res=mod-res, swap(p[r],p[i]);
    rep(j,i+1,n) {
      int c=p[j][i]*ksm(p[i][i],mod-2)%mod;
      rep(k,i,n) p[j][k]=(p[j][k]+mod-p[i][k]*c%mod)%mod;
    } res=res*p[i][i]%mod;
  }
  return res;
}
void itp() {
  rep(i,0,m) {
    r[i]=y[i];
    rep(j,0,i-1) r[i]=r[i]*inv[i-j]%mod;
    rep(j,i+1,m) r[i]=mod-r[i]*inv[j-i]%mod;
  }
  g[0]=1;
  rep(i,0,m) {
    per(j,i+1,1) g[j]=(g[j-1]+g[j]*(mod-i))%mod;
    g[0]=g[0]*(mod-i)%mod;
  }
  rep(i,0,m) {
    if(i) {
      h[0]=g[0]*inv[i]%mod;
      rep(j,1,m) h[j]=(h[j-1]-g[j]+mod)*inv[i]%mod;
    } else rep(j,0,m) h[j]=g[j+1];
    rep(j,0,m) f[j]=(f[j]+h[j]*r[i])%mod;
  }
}

signed main() {
  n=read(); init();
  rep(i,1,n) a[i]=read(), u[i]=pii(a[i],i), m-=a[i];
  rep(i,1,n) b[i]=read(), v[i]=pii(b[i],i), m+=b[i];
  if(m&1) return puts("0"), 0; m/=2;
  sort(u+1,u+n+1); sort(v+1,v+n+1);
  rep(i,1,n) if(u[i].se!=v[i].se) return puts("0"), 0;
  rep(i,1,n) a[i]=u[i].fi, b[i]=v[i].fi;
  rep(z,0,m) {
    rep(i,1,n) rep(j,1,n) p[i][j]=F(b[j]-a[i],z);
    y[z]=det();
  }
  itp();
  rep(i,0,m) ans=(ans+f[i]*fac[2*m-2*i]%mod*ifac[m-i]%mod*fac[m])%mod;
  rep(i,1,m) ans=ans*((mod+1)/2)%mod;
  printf("%lld\n",ans);
  return 0;
}