#include<bits/stdc++.h>
#define reg register
// #define int long long
inline int read(){
    reg int x=0,k=1; reg char ch=getchar();
    while (ch<'0'||ch>'9') (ch=='-')&&(k=-1),ch=getchar();
    while ('0'<=ch&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*k;
}
const int N=2e5+10,mod=1e9+7;
int n,a[N],b[N],c[N],m,ans;
int pre[N],suf[N],pw[N];
signed main(){
    n=read();
    for (reg int i=1;i<=n;i++) c[++m]=a[i]=read();
    pw[0]=1; for (reg int i=1;i<=n;i++) pw[i]=(pw[i-1]+pw[i-1])%mod; 
    for (reg int i=1;i<=n;i++){
        c[++m]=b[i]=read();
        if (a[i]>b[i]) std::swap(a[i],b[i]);
        ans=(ans+mod-1ll*(a[i]+b[i])*pw[n-1])%mod;
    }
    std::sort(c+1,c+m+1),m=std::unique(c+1,c+m+1)-c-1;
    for (reg int i=m;i;i--){
        for (reg int j=1;j<=n;j++){
            reg int now=(a[j]>c[i-1])+(b[j]>c[i-1]);
            pre[j]=(pw[j]+mod-1ll*(pw[j-1]-pre[j-1])*(2-now)%mod)%mod;
        }
        for (reg int j=n;j;j--){
            reg int now=(a[j]>c[i-1])+(b[j]>c[i-1]);
            suf[j]=(pw[n-j+1]+mod-1ll*(pw[n-j]-suf[j+1])*(2-now)%mod)%mod;
        }
        reg int d=c[i]-c[i-1];
        for (reg int j=1;j<=n;j++){
            if (a[j]>c[i-1]) ans=(ans+1ll*d*pw[n-1])%mod; 
            else ans=(ans+1ll*pre[j-1]*suf[j+1])%mod;
            if (b[j]>c[i-1]) ans=(ans+1ll*d*pw[n-1])%mod; 
            else ans=(ans+1ll*pre[j-1]*suf[j+1])%mod;
            // std::cerr<<"<< "<<ans<<"\n";
        }
        // for (reg int i=1;i<=n;i++) std::cerr<<pre[i]<<" "<<suf[i]<<"\n";
        // std::cerr<<ans<<"\n";
    }
    printf("%d\n",ans);
    return 0;
}