#nullable enable

#region
var (_input, _iter) = (Array.Empty<string>(), 0);
T I<T>() where T : IParsable<T>
{
    while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Trim().Split(' '), 0);
    return T.Parse(_input[_iter++], null);
}
#endregion

static T[] Range<T>(int n, Func<T> F) => Enumerable.Range(0, n).Select(_ => F()).ToArray();

const int Mod = 1000000007;

static long Power(long v, long p, long mod)
{
    var (res, k) = (1L, v);
    while (p > 0)
    {
        if ((p & 1) > 0) res = res * k % mod;
        k = k * k % mod;
        p >>= 1;
    }
    return res;
}

var n = I<int>();
var az = new List<long>();
var bz = new List<long>();
{
    var oaz = Range(n, I<int>);
    var obz = Range(n, I<int>);
    for (var i = 0; i < n; i++)
    {
        var a = oaz[i];
        var b = obz[i];
        if (a == 0) continue;
        az.Add(a);
        bz.Add(b);
    }
    n = az.Count;
}
var oz = Enumerable.Range(0, n).ToArray().AsSpan();
oz.Sort((i, j) => {
    var ai = az[i];
    var aj = az[j];
    var bi = bz[i];
    var bj = bz[j];
    return (bi * aj).CompareTo(bj * ai);
});

var hi2 = oz[(n - 1) / 2];
var hi1 = oz[n - 1 - (n - 1) / 2];

decimal F(long p, long q)
{
    decimal res = 0;
    for (var i = 0; i < n; i++)
    {
        var a = az[i];
        var b = bz[i];
        var y = a * p - b * q;
        if (y < 0) y = -y;
        res += (decimal)y / q;
    }
    return res;
}
var ai = hi1;
if (F(bz[hi1], az[hi1]) > F(bz[hi2], az[hi2])) ai = hi2;

var ans = bz[ai] * Power(az[ai], Mod - 2, Mod) % Mod;
Console.WriteLine(ans);