#include<stdio.h>
long long int modpow(long long int a, long long int n, long long int p)
{
	long long int res = 1;
	for (; n > 0; n /= 2, a = a * a % p)
		if (n % 2 > 0)
			res = res * a % p;
	return res;
}
long long int A[200005], B[200005];
long long int h[200005], l;
long long int comp_h(long long int a, long long int b)
{
	if (A[h[b]] * B[h[a]] > A[h[a]] * B[h[b]])
		return 1;
	else
		return -1;
}
void swap_h(long long int a, long long int b)
{
	long long int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(long long int ne)
{
	h[l] = ne;
	long long int p = l++;
	for (; p > 0; p = (p - 2) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
long long int pop()
{
	swap_h(0, --l);
	long long int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
long long int id[200005];
int main()
{
	long long int n;
	scanf("%lld", &n);
	long long int i, j;
	for (i = 0; i < n; i++)
		scanf("%lld", &A[i]);
	for (i = 0; i < n; i++)
		scanf("%lld", &B[i]);
	long long int f = 0;
	if (n < 1 || 200000 < n)
		f++;
	for (i = 0; i < n; i++)
		if (A[i] < -1000000000 || B[i] < -1000000000 || 1000000000 < A[i] && 1000000000 < B[i])
			f++;
	if (f > 0)
	{
		printf("%d\n", 1 / 0);
		return 1;
	}
	const long long int p = 1000000007;
	for (j = i = 0; i < n; i++)
	{
		if (A[i] == 0)
			continue;
		if (A[i] < 0)
		{
			A[i] *= -1;
			B[i] *= -1;
		}
		A[j] = A[i];
		B[j] = B[i];
		j++;
	}
	n = j;
	l = 0;
	for (i = 0; i < n; i++)
		push(i);
	for (i = 0; i < n; i++)
		id[i] = pop();
	long long int sum = 0;
	for (i = 0; i < n; i++)
		sum += A[i];
	for (i = 0;; i++)
	{
		sum -= 2 * A[id[i]];
		if (sum <= 0)
			break;
	}
	long long int ans = B[id[i]] * modpow(A[id[i]], p - 2, p) % p;
	ans = (ans + p) % p;
	printf("%lld\n", ans);
	return 0;
}