#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint1000000007;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}


template<typename T>
struct point{
    T x, y;
    point(T x, T y): x(x), y(y) {}
};

template<typename T>
ostream& operator<<(ostream& os, const point<T>& p){
    os << p.x << ' ' << p.y;
    return os;
}

/**
 * for sorting by atan2(x, y)
 * verified: https://judge.yosupo.jp/submission/91704
 */
template<typename T>
bool comp(point<T> p1, point<T> p2){
    if(p1.y >= 0 && p2.y < 0) return false;
    if(p1.y < 0 && p2.y >= 0) return true;
    if(p1.y == 0 && p2.y == 0) return p1.x > p2.x;
    if(p1.y == 0 && p1.x == 0) return p2.y > 0;
    if(p2.y == 0 && p2.x == 0) return p1.y < 0;
    return p1.y*p2.x < p1.x*p2.y;
}

using Po = point<ll>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<Po> ps;
    for(int i = 0; i < n; i++){
        int x, y; cin >> x >> y;
        ps.push_back(Po(x, y));
        ps.push_back(Po(-x, -y));
    }
    sort(ps.begin(), ps.end(), comp<ll>);
    ll x = 0, y = 0;
    mint b = 0;
    mint s = 0;
    for(auto p: ps){
        ll xx = x+p.x;
        ll yy = y+p.y;
        ll g = gcd(abs(p.x), abs(p.y));
        s += (mint(yy)*mint(x)-mint(xx)*mint(y))/2;
        b += g;
        x = xx;
        y = yy;
    }
    mint ans = s+b/2+1;
    cout << ans << endl;
}