#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;
using ll = long long;
using ull = unsigned long long;

constexpr ll LLINF {1001002003004005006};//ll = 9*LLINF
constexpr int INTINF {1000000000};//int = 2*INTINF

#define  rep(i,n)   for(int i = 0; i < (n); ++i)
#define rrep(i,n)   for(int i = 1; i <= (n); ++i)
#define drep(i,n)   for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for(int i = s; i < t;  ++i)

template<typename T>
void maxs(T& x, T&& y) {
  x=std::max(x,y);
}
template<typename T>
void maxs(T& x, T& y) {
  x=std::max(x,y);
}

template<typename T>
void mins(T& x, T&& y) {
  x=std::min(x,y);
}
template<typename T>
void mins(T& x, T& y) {
  x=std::min(x,y);
}

struct DataType {
    ll a,b;
};
bool operator<(const DataType& l, const DataType& r) {
    return r.b*l.a + r.a < l.b*r.a + l.a;
}

int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n;
  cin >> n;
  vector<DataType> a(n);
  rep(i,n) cin >> a[i].a;
  rep(i,n) cin >> a[i].b;

  sort(a.begin(), a.end());
  ll mod {1000000000+7};
  ll lv {1};
  ll reward {};

  rep(i,n) {
    reward += lv*a[i].a;
    lv *= a[i].b;
    lv %= mod;
    reward %= mod;
  }
  cout << reward << '\n';
}