#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>

using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<1000000007>;

struct Vec2 { long long x, y; };

std::vector<int> sort_points_by_argument(const std::vector<Vec2>& points) {
    std::vector<int> case_split[9];
    for (int i = 0; i < (int)points.size(); i++) {
        int case_id = 0;
        if (points[i].x == 0) case_id += 1;
        if (points[i].x > 0) case_id += 2;
        if (points[i].y == 0) case_id += 3;
        if (points[i].y > 0) case_id += 6;
        case_split[case_id].push_back(i);
    }
    auto sort_by_argument_small = [&points](int l, int r)->bool {
        return points[l].x * points[r].y - points[l].y * points[r].x > 0;
    };
    for (int t = 0; t < 9; t++) {
        std::sort(case_split[t].begin(), case_split[t].end(), sort_by_argument_small);
    }
    std::vector<int> res;
    res.reserve(points.size());
    for (int case_id : { 0, 1, 2, 4, 5, 8, 7, 6, 3 }) {
        std::copy(case_split[case_id].begin(), case_split[case_id].end(), std::back_inserter(res));
    }
    return res;
}

i64 GCD(i64 a, i64 b){
	return b ? GCD(b, a%b) : a;
}

i64 countLatticePointOnSegment(Vec2 p){
	return 1 + GCD(abs(p.x), abs(p.y));
}

int main(){
	int N; cin >> N;
	vector<Vec2> A(N);
	rep(i,N){
		cin >> A[i].x;
		cin >> A[i].y;
	}
	rep(i,A.size()){
		if(A[i].x == 0 && A[i].y == 0){
			swap(A[i], A.back());
			A.pop_back();
			i--;
		}
	}

	if(A.empty()){ cout << "1\n"; return 0; }
	if(A.size() == 1){ cout << countLatticePointOnSegment(A[0]) << '\n'; return 0; }

	for(int i=(int)A.size()-1; i>=0; i--) A.push_back({ -A[i].x, -A[i].y });
	vector<Vec2> B;
	for(auto i : sort_points_by_argument(A)) B.push_back(A[i]);

	modint ans = 0;

	modint x = 0;
	modint y = 0;
	for(auto p : B){
		ans += x * (y + p.y) - y * (x + p.x);
		x += p.x;
		y += p.y;
	}
	
	for(auto p : B){
		if(p.x == 0 || p.y == 0) ans += abs(p.x) + abs(p.y);
		else ans += GCD(abs(p.x), abs(p.y));
	}

	ans += 2;
	ans /= 2;

	cout << ans.val() << '\n';
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;