#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define MOD2 998244353
#define INF 1000000007
#define LINF 1000000000000000007LL
#define PI 3.14159265359
#define P pair<ll,ll>
template <typename T>
inline bool chmax(T &a, const T &b){
    if(a<b) {a=b; return true;}
    else return false;
}
template <typename T>
inline bool chmin(T &a, const T &b){
    if(a>b) {a=b; return true;}
    else return false;
}
struct Edge{
    int to; ll cost;
    Edge(int to, ll cost) : to(to), cost(cost) {}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &g,int from,int to,ll cost,bool rev,ll rev_cost){
    g[from].push_back(Edge(to,cost));
    if(rev) g[to].push_back(Edge(from,rev_cost));
}
 
 
 
void solve(){
    int n;
    cin>>n;
    ll a[210000];
    ll b[210000];
    rep(i,n){
        cin>>a[i];
    }
    rep(i,n){
        cin>>b[i];
    }
    

    pair<double,int> p[210000];
    rep(i,n){
        double c = (double)(1LL-b[i])/a[i];
        p[i] = {c,i};
    }

    sort(p,p+n);
    ll ans=0;
    ll x=1;
    rep(i,n){
        int ind = p[i].second;
        ans += x*a[ind] %MOD;
        ans %=MOD;
        x = x*b[ind] %MOD;
    }

    cout<<ans<<endl;
}
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout<<setprecision(10)<<fixed;
    solve();
    return 0;
}