#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;


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

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

using P=pair<ll,ll>;

template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}

    Modint &operator+=(const Modint &p){
			if((x+=p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator-=(const Modint &p){
			if((x+=mod-p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator*=(const Modint &p){
			x = (1LL * x * p.x) % mod;
			return *this;
		}

		Modint &operator/=(const Modint &p){
			*this *= p.inverse();
			return *this;
		}

		Modint operator-() const { return Modint(-x); }
		Modint operator+(const Modint &p) const{
			return Modint(*this) += p;
		}
		Modint operator-(const Modint &p) const{
			return Modint(*this) -= p;
		}
		Modint operator*(const Modint &p) const{
			return Modint(*this) *= p;
		}
		Modint operator/(const Modint &p) const{
			return Modint(*this) /= p;
		}

		bool operator==(const Modint &p) const { return x == p.x; }
		bool operator!=(const Modint &p) const{return x != p.x;}

		Modint inverse() const{//非再帰拡張ユークリッド
			int a = x, b = mod, u = 1, v = 0;
			while(b>0){
				int t = a / b;
				swap(a -= t * b, b);
				swap(u -= t * v, v);
			}
			return Modint(u);
		}

		Modint pow(int64_t n) const{//繰り返し二乗法
			Modint ret(1), mul(x);
			while(n>0){
				if(n&1)
					ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return ret;
		}

		friend ostream &operator<<(ostream &os,const Modint &p){
			return os << p.x;
		}
};

using modint = Modint<mod>;

void solve(){
	int n;
	cin>>n;
	map<P,ll>mp;
	modint ans=0;
	rep(i,n){
		ll a,b;
		cin>>a>>b;
		ll x=gcd(a,b);
		if(a!=0&&b!=0){
			ll c=a/x,d=b/x;
			if(min(c,d)<0&&max(c,d)>0){
				c=-abs(c),d=abs(d);
			}
			else{
				c=abs(c),d=abs(d);
			}
			mp[P{c,d}]++;
		}
		else if(a==0&&b==0){
			ans+=1;
		}
		else if(a==0){
			mp[P{1,0}]++;
		}
		else{
			mp[P{0,1}]++;
		}
	}
	modint cul=1;
	for(auto x:mp){
		if(x.second==0)continue;
		//cout<<x.first.first<<" "<<x.first.second<<"\n";
		if(max(x.first.first,x.first.second)==1&&min(x.first.first,x.first.second)==0){
			ll mul=x.second;
			ll a=x.first.first,b=x.first.second;
			mp[P{a,b}]=0;
			ll mul2=0;
			if(mp.count(P{b,a}))mul2=mp[P{b,a}],mp[P{b,a}]=0;
			modint s=2,t=2;
			cul*=(s.pow(mul)-1)+(t.pow(mul2)-1)+1;
		}
		else{
			ll mul=x.second;
			ll a=x.first.first,b=x.first.second;
			mp[P{a,b}]=0;
			ll mul2=0;
			if(mp.count(P{b,-a}))mul2=mp[P{b,-a}],mp[P{b,-a}]=0;
			modint s=2,t=2;
			cul*=(s.pow(mul)-1)+(t.pow(mul2)-1)+1;
		}
	}
	ans+=cul;
	ans-=1;
	cout<<ans<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}


Measured memory_bytes: 16096