#include<bits/stdc++.h>
#define int long long
using namespace std;
bool b[1000030];
const int mod=1e9+7;
int n,m[1000030],a[1000030],xp[1000030];
struct node{
	int sum,num;
};
bool cmp(node x,node y){
	return x.sum<y.sum;
}
vector<node> v;
signed main(){
//	freopen("hole7.in","r",stdin);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>m[i];
	}
	for(int i=1;i<=n;i++){
		cin>>a[i];
		v.push_back({a[i]-1,i});
		v.push_back({m[i]-a[i],i});
	}
	sort(v.begin(),v.end(),cmp);
	xp[0]=1;
	for(int i=1;i<=n;i++){
		xp[i]=xp[i-1]*2;
		xp[i]%=mod;
	}
	int idx=n,sum=0;
	for(auto i:v){
		if(b[i.num]){
			sum+=i.sum*xp[idx];
			sum%=mod;
			break;
		}
		else{
			idx--;
			b[i.num]=1;
			sum+=i.sum*xp[idx];
			sum%=mod;
		}
	}
	cout<<(sum+1)%mod;
}