#include <algorithm>
#include <iostream>
#include <numeric>
#include <tuple>
#include <vector>

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	int N;
	cin >> N;

	vector<tuple<long long, long long, long long, long long>> ev;
	vector<pair<long long, long long>> pts;
	for (int i = 0; i < N; ++i)
	{
		long long a, b;
		cin >> a >> b;
		if (a == 0 && b == 0)
			continue;
		ev.emplace_back(-b, a, a, b);
		ev.emplace_back(b, -a, -a, -b);
	}
	sort(ev.begin(), ev.end(), [&](auto a, auto b)
		 {
		auto [ax, ay, a1, a2] = a;
		auto [bx, by, b1, b2] = b;
		bool ar = make_pair(ax, ay) > make_pair(0LL, 0LL);
		bool br = make_pair(bx, by) > make_pair(0LL, 0LL);
		if(ar!=br) return br;
		return ax*by > bx*ay; });
	long long x = 0, y = 0;
	for (auto [xe, ye, v1, v2] : ev)
	{
		x += v1;
		y += v2;
		pts.emplace_back(x, y);
	}

	const int MOD = 1e9 + 7;

	long long A = 0, B = 0;
	for (int i = 0; i < (int)pts.size(); ++i)
	{
		int j = (i + 1) % (int)pts.size();
		auto [ax, ay] = pts[i];
		auto [bx, by] = pts[j];

		A = (A + ((ax % MOD) * (by % MOD)) - ((bx % MOD) * (ay % MOD))) % MOD;
		B = (B + gcd(abs(ax - bx), abs(ay - by))) % MOD;
	}
	if (A < 0)
		A += MOD;
	if (A % 2 == 1)
		A += MOD;
	A /= 2;

	long long hB = B;
	if (hB < 0)
		hB += MOD;
	if (hB % 2 == 1)
		hB += MOD;
	hB /= 2;
	long long ans = (A + hB + 1) % MOD;

	cout << ans << endl;
}