#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int dx[]={1,0,0,-1},dy[]={0,1,-1,0};
struct st{
	ll a,b;
};
bool operator<(st a,st b){
	return a.a+b.a*a.b>b.a+a.a*b.b;
}
int main(){
	int n;
	static st ab[200000];
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>ab[i].a;
	for(int i=0;i<n;i++)
		cin>>ab[i].b;
	sort(ab,ab+n);
	ll ans=0,tmp=1;
	for(int i=0;i<n;i++){
		ans=(ans+ab[i].a*tmp)%mod;
		tmp=tmp*ab[i].b%mod;
	}
	cout<<ans<<endl;
}