#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

bool _2d_comp(pair<ll,ll> &l,pair<ll,ll> &r){
	if(l.first==0&&r.first==0) return l.second>r.second;
	if(l.first==0){
		return l.second>0||r.first<0;
	}
	if(r.first==0){
		return !(r.second>0||l.first<0);
	}
	if((l.first<0)^(r.first<0)) return l.first>0;
	return l.first*r.second<l.second*r.first;
}

bool _2d_same(pair<ll,ll> &l,pair<ll,ll> &r){
	if((l.first<0)^(r.first<0)) return false;
	if((l.second<0)^(r.first<0)) return false;
	if((l.first==0)&&(r.second==0)) return false;
	if((l.second==0)&&(r.first==0)) return false;
	return l.first*r.second==l.second*r.first;
}


void solve();
// KITAKU BEATS
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<pair<pair<ll,ll>,pair<ll,ll>>> p;
	vector<ll> X={0},Y={0};
	vector<ll> A(N),B(N);
	rep(i,N){
		ll a,b;
		cin>>a>>b;
		A[i]=a,B[i]=b;
		if(a==0&&b==0) continue;
		pair<ll,ll> S={-b,a},T={b,-a};
		p.push_back({S,{1,i}});
		p.push_back({T,{-1,i}});
		if(!_2d_comp(S,T)){
			X[0]+=a,Y[0]+=b;
		}
	}
	if(p.empty()){
		cout<<"1\n";
		return ;
	}
	sort(all(p),[&](auto l,auto r){
		return _2d_comp(l.first,r.first);
	});
	int L=p.size(),p_ind=0,a_ind=0;
	while(L!=p_ind){
		X.push_back(X[a_ind]);
		Y.push_back(Y[a_ind]);
		a_ind++;
		do{
			ll s=p[p_ind].second.first;
			X[a_ind]+=A[p[p_ind].second.second]*s;
			Y[a_ind]+=B[p[p_ind].second.second]*s;
			p_ind++;
		}while(p_ind!=L&&_2d_same(p[p_ind].first,p[p_ind-1].first));
	}
	if(a_ind==2){
		cout<<(1+__gcd(abs(X[0]-X[1]),abs(Y[0]-Y[1])))%mod<<"\n";
		return ;
	}
	//vec_out(X);
	//vec_out(Y);
	ll ans=0;
	rep(i,a_ind){
		ans+=__gcd(abs(X[i]-X[i+1]),abs(Y[i]-Y[i+1]));
		ans%=mod;
		ans+=((X[i+1]%mod)*(Y[i]%mod))%mod;
		ans-=((X[i]%mod)*(Y[i+1]%mod))%mod;
		ans%=mod;
	}
	ans+=2;
	ans=(ans%mod+mod)%mod;
	cout<<(ans*((mod+1)/2))%mod<<"\n";
}