#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("nuroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORR(x,arr) for(auto& x:arr)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define FI first 
#define SE second
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------


struct mint {
	ll x;
	mint(ll x=0):x(x%mod){}

	bool operator==(const mint a)const{return x==a.x;}
	bool operator!=(const mint a)const{return x!=a.x;}
	bool operator>=(const mint a){return (x >= a.x)? 1: 0;}
	bool operator<(const mint a){return !(*this>=a);}
	bool operator>(const mint a){return (x > a.x)? 1:0;}
	bool operator<=(const mint a){return !(*this>a);}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod-a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res+=a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res-=a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res*=a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t>>1);
		a *= a;  //2 square
		if (t&1) a *= *this; 
		return a;
	}
	// for prime mod
	mint inv() const {
		return pow(mod-2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res/=a;
	}
};

template <class T>
T gcd(T x, T y){
	T r;
	if(x < y) swap(x,y);
	while(y > 0){
		r = x % y;
		x = y;
		y = r;
	}
	return x;
}

int n;
map<PLL, int> mp;
int both0 = 0;

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);

    cin >> n;
	
    FOR(i,1,n) {
        ll a,b; cin >> a >> b;
		if (!a and !b) {
			both0++; continue;
		}
		if (!a) {
			mp[{0, -1}]++;
			continue;
		}
		if (!b) {
			mp[{1,0}]++;
			continue;
		}

		ll gd = gcd(abs(a),abs(b));
		a /= gd; b /= gd;
		if(a < 0) {
			a = -a;
			b = -b;
		}
		mp[{a,b}]++;
    }


	mint ans = mint(1);
	for(auto [k, v]: mp) {
		// cout << k.first << " " << k.second << " " << v << endl;
		// ll ca = abs(k.second);
		// ll cb = k.first*(k.first*k.second<0?1:-1);
		PLL p;
		if(k.second < 0) p = {-k.second, k.first};
		else p = {k.second, -k.first};
		// cout << ca << " " << cb << " " << v << endl;
		// PII p = {ca, cb};
		// if(k == p) ans *= mint(2).pow(v); 
		if(mp.count(p)) {
			if (k.second < 0) continue;
			ans *= mint(2).pow(v) + mint(2).pow(mp[p]) - 1;
		}
		else ans *= mint(2).pow(v);
		// cout << "ans" << ans.x << endl;
	}

	ans += both0;
	ans -= 1;
	cout << ans.x << endl;
	return 0;
}


Measured memory_bytes: 16128