#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  int N; cin >> N;
  ll A[N], B[N]; rep(i,N) cin >> A[i] >> B[i];

  ll p2[N+1] = {}; rep(i,N+1) p2[i] = i==0 ? 1 : (p2[i-1]*2)%MOD;
  ll az = 0, bz = 0;
  map<p_ll, ll> adb, bda; 
  rep(i,N) {
    if (A[i]==0&&B[i]==0) continue;
    else if (A[i]==0) az++;
    else if (B[i]==0) bz++;
    else {
      ll gab = gcd(abs(A[i]), abs(B[i])); A[i] /= gab; B[i] /= gab;
      if (B[i]<0) { A[i] *= -1; B[i] *= -1; }
      if (A[i]>0) adb[make_pair(A[i],B[i])]++;
      else bda[make_pair(B[i],-1*A[i])]++;
    }
  }
  // for (auto x: adb) cout << x.first << "->" << x.second << endl;

  ll result = 1;
  for (auto x: adb) {
    if (bda.count(x.first)) {
      result = result * (p2[x.second]+p2[bda[x.first]]-1) % MOD;
      // cout << x.first.first << "," << x.first.second << "->" << (p2[x.second]+p2[bda[x.first]]-1) << endl;
    }
    else {
      result = result * p2[x.second] % MOD;
      // cout << x.first.first << "," << x.first.second << "->" << p2[x.second] << endl;
    }
  }

  for (auto x: bda) {
    if (adb.count(x.first)) continue;
    else {
      result = result * p2[x.second] % MOD;
      // cout << x.first.first << "," << x.first.second << "->" << p2[x.second] << endl;
    }
  }

  result = result * (p2[az]+p2[bz]-1) % MOD;

  result = (result-1+MOD) % MOD;
  cout << result << endl;
  return 0;
}