#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll GCD(ll a, ll b) { return (b == 0) ? a : GCD(b, a % b); }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll N;
  cin >> N;
  map<pair<ll, ll>, pair<ll, ll>> cnt;
  ll cnt00 = 0;
  for (ll i = 0; i < N; i++) {
    ll A, B;
    cin >> A >> B;
    if (A == 0 || B == 0) {
      cnt00++;
      continue;
    }
    ll g = GCD(abs(A), abs(B));
    A /= g, B /= g;
    if (A == 0) {
      cnt[{0, 0}].first++;
    } else if (B == 0) {
      cnt[{0, 0}].second++;
    } else {
      if (A < 0) {
        A = -A, B = -B;
      }
      if (B > 0)
        cnt[{A, B}].first++;
      else
        cnt[{-B, A}].second++;
    }
  }
  ll MOD = 1e9 + 7;
  vector<ll> pow2(200200, 0);
  pow2[0] = 1;
  for (ll i = 1; i < 200200; i++) {
    pow2[i] = (pow2[i - 1] * 2) % MOD;
  }
  ll ans = 1;
  for (auto p : cnt) {
    ans =
        (ans * (pow2[p.second.first] + pow2[p.second.second] - 1) % MOD) % MOD;
  }
  ans = (ans + cnt00 - 1 + MOD) % MOD;
  cout << ans << '\n';
  return 0;
}
