#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using pint = pair<lint, lint>;
using vp = vector<pint>;
using mint = modint1000000007;
using vm = vector<mint>;

int main() {
	lint N;
	cin >> N;
	vi v(N), w(N);
	vin(v);
	vin(w);

	mint a=0, b=1, c=0;
	lint x, y, z=0;
	vp p(N);
	rep(i, N) z += v[i];
	rep(i, N) p[i] = {v[i], w[i]};
	sort(all(p), [](auto const& lhs, auto const& rhs) {
		return lhs.first*rhs.second+rhs.first < rhs.first*lhs.second+lhs.first;
	});
	rep(i, N) {
		tie(x, y) = p[i];
		a += x*b;
		b *= y;
	}
	std::cout << a.val() << '\n';
}