#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using P=pair<ll,ll>;
#define mod 1000000007

ll modpow(ll n,ll m=mod-2){
  ll r=1;
  while(m) r=r*((m%2)?n:1)%mod,n=n*n%mod,m>>=1;
  return r;
}

int main(){

  int n;
  cin >> n;

  map<P,P> mp;
  long long zero=0;
  int sum = 1;

  for(int i=0;i<n;i++){
    ll a,b;
    cin >> a >> b;
    if(a==0 && b==0) zero++;
    else if(a==0){
      mp[make_pair(0,1)].first++;
      mp[make_pair(0,1)].second++;
    }else if(b==0){
      mp[make_pair(1,0)].first++;
      mp[make_pair(1,0)].second;
    }else{
      ll g = gcd(a, b);
      a=a/g;
      b=b/g;
      if(mp[make_pair(b,-a)].first>0) mp[make_pair(b,-a)].second++;
      else if(mp[make_pair(-b,a)].first>0) mp[make_pair(-b,a)].second++;
      else mp[make_pair(a,b)].first++;
    }
  }

  for(auto p:mp){
    ll s = p.second.first;
    ll t = p.second.second;
    ll now = 1;
    now += modpow(2,s)-1;
    now += modpow(2,t)-1;
    sum *= now;
    sum = sum%mod;
  }

  sum -= 1;
  sum += zero %mod;
  cout << sum << endl;

}