#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint1000000007;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<P> ab;
  VI A(n), B(n);
  rep(i, n) cin >> A[i];
  rep(i, n) cin >> B[i];
  rep(i, n) {
    int a = A[i], b = B[i];
    if (a < 0) a *= -1, b *= -1;
    if (a) ab.emplace_back(a, b);
  }
  sort(all(ab), [](P s, P t) {
    auto [as, bs] = s;
    auto [at, bt] = t;
    // bs/as < bt/at
    return (ll)bs * at < (ll)bt * as;
  });
  ll sm = 0;
  for (auto [a, b] : ab) sm -= a;
  int i = 0;
  while (sm < 0) sm += 2 * ab[i++].first;
  i--;
  mint x = mint(ab[i].second) / mint(ab[i].first);
  cout << x.val() << '\n';
}