#include<bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
//指数をある値で割った余り
ll mpow(ll a , ll b , ll M){
    ll ret = 1;
    ll V = a;
    for (int i=0; i<64; i++) {
        if((b >> i) & 1)ret=(ret*V)%M;
        V=(V*V)%M;
    }
    return ret;
}
signed main() {
  int N; cin >> N;
  vector<int> A(N), B(N);
  for (int i=0; i<N; i++) cin >> A[i];
  for (int i=0; i<N; i++) cin >> B[i];
  vector<pair<int, int>> P;
  for (int i=0; i<N; i++) {
    int a = A[i], b = B[i];
    if (a < 0) a = -a, b = -b;
    if (a == 0) continue;
    P.push_back({a, b});
  }
  sort(P.begin(), P.end(), [](auto x, auto y) { return x.second * y.first < x.first * y.second; } );
  if (P.size() == 0) {
    exit(-1);
  }
  ll sum = 0; for (auto [a,b]: P) sum -= a;
  for (auto [a,b]: P) {
    sum += 2 * a;
    if (sum >= 0) {
      cout << b * mpow(a, 1e9 + 5, 1e9 + 7) % (int)(1e9 + 7) << endl;
      return 0;
    }
  }
}