#include<bits/stdc++.h>
#define L(i,s,t) for(int i=(s);i<=(t);++i)
#define R(i,s,t) for(int i=(s);i>=(t);--i)
#define T(i,s,t) for(int i=(s);i< (t);++i)
#define iV inline void
#define iI inline int
#define iB inline bool
#define ll long long
#define il inline ll
#define I(x) (1<<(x))
#define lb(x) (x&(-x))
#define eb emplace_back
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define pt putchar
using namespace std;
const int N=33,M=6003,P=998244353;
iI add(int x) {return x>=P?x-P:x;}
iI dcl(int x) {return x< 0?x+P:x;}
iV Add(int &x,int y) {(x+=y)>=P&&(x-=P);}
iV Dcl(int &x,int y) {(x-=y)< 0&&(x+=P);}
iV Mul(int &x,int y) {x=1ll*x*y%P;}
iI qpw(int x,int p=P-2) {
    int s=1;
    for(;p;p>>=1,Mul(x,x)) if(p&1) Mul(s,x);
    return s;
}
int n,U,a[N],b[N],det[N][N],fac[M],inv[M];
int f[M],g[M];
iI clc(int v) {
    L(i,1,n) L(j,1,n) {
        int c=b[j]-a[i],s=0,t=1;
        L(y,0,c>>1) {
            int k=1ll*inv[y]*inv[c-2*y]%P*t%P;
            y&1?Dcl(s,k):Add(s,k);Mul(t,v);
        }det[i][j]=s;
    }
    bool o=0;
    L(i,1,n) {
        int p=i;
        L(j,i+1,n) if(det[j][i]>det[p][i]) p=j;
        if(p^i) o^=1,swap(det[i],det[p]);
        if(!det[i][i]) return 0;
        int v=qpw(det[i][i]);
        L(j,i+1,n) if(det[j][i]) {
            int d=1ll*det[j][i]*v%P;
            L(k,i,n) Dcl(det[j][k],1ll*d*det[i][k]%P);
        }
    }
    int ans=1;
    L(i,1,n) Mul(ans,det[i][i]);
    return o?add(P-ans):ans;
}
int main() {
    // freopen("test.out","w",stdout);
    cin>>n;
    L(i,1,n) cin>>a[i],U-=a[i];
    L(i,1,n) cin>>b[i],U+=b[i];
    L(i,1,n) if(a[i]>b[i]) return cout<<"0\n",0;
    static int I[N];
    L(i,1,n) I[i]=i;
    sort(I+1,I+n+1,[](int x,int y){return a[x]<a[y];});
    T(i,1,n) if(b[I[i]]>=b[I[i+1]]) return cout<<"0\n",0;  
    if(U&1) return cout<<"0\n",0;
    fac[0]=1;
    L(i,1,U) fac[i]=1ll*fac[i-1]*i%P;
    inv[U]=qpw(fac[U]);
    R(i,U,1) inv[i-1]=1ll*inv[i]*i%P;
    U>>=1,f[0]=1;
    auto mul=[&](int *d,int v){
        R(i,U,1) d[i]=dcl(d[i-1]-1ll*d[i]*v%P);
        Mul(d[0],P-v);
    };
    L(i,0,U) {
        int v=1ll*inv[i]*inv[U-i]%P*clc(i)%P;
        if((U-i)&1) v=add(P-v);
        L(j,0,U) Add(g[j],1ll*f[j]*v%P);
        if(i<U) mul(g,i+1);
        mul(f,i);
    }
    // L(i,0,U) cout<<g[i]<<" \n"[i==U];
    // static int h[M];
    // L(i,0,U) {
    //     int v=1ll*inv[i]*inv[U-i]%P*clc(i)%P;
    //     if((U-i)&1) v=add(P-v);
    //     memset(f,0,sizeof(f)),f[0]=1;
    //     L(j,0,U) if(i^j) mul(f,j);
    //     L(j,0,U) Add(h[j],1ll*f[j]*v%P);
    // }
    // L(i,0,U) cout<<h[i]<<" \n"[i==U];
    int ans=0;
    L(i,0,U) Add(ans,1ll*inv[U-i]*fac[2*(U-i)]%P*g[i]%P);
    cout<<1ll*ans*fac[U]%P*qpw(qpw(2,U))%P<<"\n";
    return 0;
}