#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lll __int128
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'A'||ch>'Z') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
const int N=20+5,mod=1e9+7;
inline int add(int a,int b){ return a+b>=mod?a+b-mod:a+b; }
inline int dec(int a,int b){ return a>=b?a-b:a+mod-b; }
inline void inc(int &a,int b){ a=a+b>=mod?a+b-mod:a+b; }
inline int qpow(int x,int y){
	int res=1;
	while(y){
		if(y&1) res=1ll*res*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return res;
}
int n,t[N],w[N],p[N],f[N],C[N][N];
ll x[N],y[N],b[N],c[N];
int main(){
	n=read();
	for(int i=0;i<n;i++)
		t[i]=read();
	for(int i=2;i<=n;i++)
		w[i]=read();
	for(int i=0;i<=n;i++){
		C[i][0]=1;
		for(int j=1;j<=i;j++)
			C[i][j]=add(C[i-1][j-1],C[i-1][j]);
	}
	int u=1<<n;
	for(int s=0;s<u;s++){
		if(__builtin_popcount(s)<=1) continue;
		int ct=0;
		for(int i=0;i<n;i++)
			if(s>>i&1)
				p[ct++]=i;
		for(int i=0;i<ct;i++)
			x[i]=t[p[i]]-t[p[0]],y[i]=t[p[i]];
		for(int i=1;i<ct;i++){
			int tc=0;
			c[i]=x[i];
			for(int j=1;j<i;j++) c[j]=y[j];
			b[i]=i==1?x[i]:y[i];
			for(int j=1;j<=i;j++){
				int p=1;
				for(int k=1;k<=i;k++){
					int w=__gcd(b[j]/p,c[k]);
					c[k]/=w,p*=w;
				}
				b[j]=p;
			}
		}
		ll u=1,v=1;
		for(int i=1;i<ct;i++) u=u*b[i]%mod;
		for(int i=0;i<ct;i++) v=v*y[i]%mod;
//		printf("%d %d/%d\n",s,u,v);
		inc(f[ct],2ll*u*qpow(v,mod-2)%mod);
	}
	int ans=0;
	for(int i=2;i<=n;i++){
		int s=0;
		for(int j=i;j<=n;j++){
			int v=1ll*f[j]*C[j][i]%mod;
			if(j-i&1) v=dec(0,v);
			inc(s,v);
		}
		inc(ans,1ll*s*w[i]%mod);
	}
	write(ans);
	flush();
}