from math import gcd
import sys
input = sys.stdin.readline
mod = 10 ** 9 + 7   

class Vector2:
	def __init__(self, x: int, y: int):
		self.x = x
		self.y = y

	def __lt__(self, other):
		return area(self, other) > 0

def area(v1: Vector2, v2: Vector2) -> int:
	return v1.x * v2.y - v1.y * v2.x

def floor_sum(n, m, a, b):
	if(m == 0):
		return 0
	res = 0
	while(True):
		if(a >= m or a < 0):
			res += n * (n - 1) * (a // m) // 2
			a %= m
		if(b >= m or b < 0):
			res += n * (b // m)
			b %= m
		y_max = a * n + b
		if(y_max < m):
			break
		n, b, m, a = y_max // m, y_max % m, a, m
	return res


n = int(input())
vector = []
for x, y in [getList() for _ in [0] * n]:
	if(x == 0 and y == 0):
		continue
	if(y < 0):
		x = -x
		y = -y
	vector.append(Vector2(x, y))
vector.sort()

ans = 1
for v in vector:
	ans += gcd(v.x, v.y)
	ans %= mod

def count():
	global ans, last, x
	a, s = k, 0
	if(x < 0):
		a, x = -a, -x
	s += floor_sum(x, x, y, 0) % mod + x * last % mod
	s %= mod
	ans += mod + a * s
	ans %= mod
	last += mod + y
	last %= mod

last, k = 0, 1
for v in vector[::-1]:
	x, y = v.x, v.y
	count()

last, k = 0, -1
for v in vector:
	x, y = v.x, v.y
	count()

print(ans)