using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var b = NList;
        var list = new List<(long ch, long pa)>();
        for (var i = 0; i < n; ++i)
        {
            if (a[i] > 0) list.Add((b[i], a[i]));
            else if (a[i] < 0) list.Add((-b[i], -a[i]));
        }
        list.Sort((l, r) => (l.ch * r.pa).CompareTo(l.pa * r.ch));
        var rem = 0L;
        for (var i = 0; i < list.Count; ++i) rem += list[i].pa;
        var add = 0L;
        for (var i = 0; i < list.Count; ++i)
        {
            rem -= list[i].pa;
            if (rem <= add)
            {
                var mod = 1_000_000_007;
                WriteLine((list[i].ch + mod) * Exp(list[i].pa, mod - 2, mod) % mod);
                return;
            }
            add += list[i].pa;
        }
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}