#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>;  using Vi = vector<long long int>;
using P = pair<int, int>;  using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rep(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";}; 
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////

template<int MOD> struct Fp {
	long long val;
	constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
		if (val < 0) v += MOD;
	}
	constexpr int getmod() { return MOD; }
	constexpr Fp operator - () const noexcept {
		return val ? MOD - val : 0;
	}
	constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
	constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
	constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
	constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
	constexpr Fp& operator += (const Fp& r) noexcept {
		val += r.val;
		if (val >= MOD) val -= MOD;
		return *this;
	}
	constexpr Fp& operator -= (const Fp& r) noexcept {
		val -= r.val;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr Fp& operator *= (const Fp& r) noexcept {
		val = val * r.val % MOD;
		return *this;
	}
	constexpr Fp& operator /= (const Fp& r) noexcept {
		long long a = r.val, b = MOD, u = 1, v = 0;
		while (b) {
			long long t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
		return this->val == r.val;
	}
	constexpr bool operator != (const Fp& r) const noexcept {
		return this->val != r.val;
	}
	friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
		return os << x.val;
	}
	friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
		return is >> x.val;
	}
	friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
		if (n == 0) return 1;
		auto t = modpow(a, n / 2);
		t = t * t;
		if (n & 1) t = t * a;
		return t;
	}
};

const int MOD = 1000000007;
using mint = Fp<MOD>;

typedef mint RUI;//型は適当に合わせて.
RUI rui(ll num,ll k){//num^k
	RUI ans = 1;
	RUI n = num;
	while(k>0){
		if(k&1)ans *= n;
		n *= n;
		k /= 2;
	}
	return ans;
}


ll n;
Vi a,b;
map<PLL,ll> ma;
PLL rev(PLL p){
	PLL ans;
	if(p.first==0){
		return mp(1LL,0LL);
	}
	if(p.second==0){
		return mp(0LL,1LL);
	}
	ans.first = p.second;
	ans.second = p.first;
	if(p.first<0){
		ans.second *= -1;
	}else{
		ans.first *= -1;
	}
	return ans;
}

int main(){
	cin.tie(0);ios::sync_with_stdio(false);
	std::cout<<std::fixed<<std::setprecision(30);
	cin>>n;
	a.resize(n);
	b.resize(n);
	set<PLL> vp;
	mint ans = 1;
	rep(i,n){
		cin>>a[i]>>b[i];
		PLL p;
		if(a[i]==0 && b[i]==0){
			p = mp(0,0);
			ma[p]++;
			vp.insert(p);
			continue;
		}
		if(a[i]==0){
			b[i] = 1;
			p = mp(a[i],b[i]);
			ma[p]++;
			vp.insert(p);
			continue;
		}
		if(b[i]==0){
			a[i] = 1;
			p = mp(a[i],b[i]);
			ma[p]++;
			vp.insert(p);
			continue;
		}
		ll div = __gcd(a[i],b[i]);
		a[i] /= div;
		b[i] /= div;
		if(a[i]<0 && b[i]<0){
			p = mp(-a[i],-b[i]);
		}else if(a[i]<0){
			p = mp(a[i],b[i]);
		}else if(b[i]<0){
			p = mp(-a[i],-b[i]);
		}else{
			p = mp(a[i],b[i]);
		}
		vp.insert(p);
		ma[p]++;
	}
	set<PLL> ck;
	for(auto& idp: vp){
		if(idp==mp(0LL,0LL)){
			continue;
		}else{
			if(ck.count(idp))continue;
			PLL idr = rev(idp);
			if(ma[idr]==0)ans *= rui(2,ma[idp]);
			else{ 
				ans *= rui(2LL,ma[idr]) + rui(2LL,ma[idp])-1;
				ck.insert(idr);
			}
		}
	}
	ans += ma[mp(0LL,0LL)];
	ans -= 1;
	print(ans);
	return 0;
}

Measured memory_bytes: 43764