#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

#define int long long

template<typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p) {
    os << "{" << p.first << ", " << p.second << "}";
    return os;
}
template<typename T>
ostream& operator<<(ostream &os, vector<T> &vec) {
    int size_of_vector = (int)vec.size();
    os << "{";
    for(int i = 0; i < size_of_vector; i++) {
        os << vec[i];
        if(i!=size_of_vector-1) os << ", ";
    }
    os << "}\n";
    return os;
}
template<typename T, size_t N>
ostream& operator<<(ostream &os, array<T, N> ar) {
    os << "{";
    for(int i = 0; i < N; i++) {
        os << ar[i];
        if(i!=N-1) os << ", ";
    }
    os << "}";
    return os;
}

template<typename T>
void dbg(T a) {
    cout << a << endl;
}

void solve() {
    int n;
    cin >> n;
    vi a(n), b(n);
    FOR(n) cin >> a[i];
    FOR(n) cin >> b[i];

    vector<int> order(n);
    iota(all(order), 0);
    sort(all(order), [&](int i, int j) {
        return a[i] * (1-b[j]) > a[j] * (1-b[i]);
    });

    int cur = 1;
    int ans = 0;
    for(int i : order) {
        (ans += cur * a[i] % mod) %= mod;;
        (cur *= b[i]) %= mod;
    }

    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}