#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

bool ord(pair<ll, ll> &x, pair<ll, ll> &y){
    return x.first - y.first + y.first * x.second - x.first * y.second > 0;
}

const ll modc = 1e9+7;

int main(){

    ll N, ans=0, lv=1, a, b;
    cin >> N;
    vector<pair<ll, ll>> AB(N);
    for (int i=0; i<N; i++) cin >> AB[i].first;
    for (int i=0; i<N; i++) cin >> AB[i].second;
    sort(AB.begin(), AB.end(), ord);

    for (int i=0; i<N; i++){
        tie(a, b) = AB[i];
        ans += (lv * a) % modc;
        ans %= modc;
        lv = (lv * b);
        lv %= modc;
    }

    cout << ans << endl;

    return 0;
}