#include <iostream>
#include <map>
#include <numeric>
#include <vector>

using namespace std;
using ll = long long;
using P = pair<int, int>;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)

const int MOD = 1000000007;

ll modpow(ll x, ll n) {
  if (n == 0) return 1;
  if (n % 2 == 0) {
    return modpow((x % MOD) * (x % MOD), n / 2);
  } else {
    return (x % MOD) * modpow((x % MOD) * (x % MOD), n / 2);
  }
}

const int mod = 1000000007;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  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 { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    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 { return mint(*this) /= a; }
};

istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }

int main() {
  int n;
  cin >> n;

  ll zero = 0;

  map<pair<ll, ll>, P> mp;

  rep(i, n) {
    int x, y;
    cin >> x >> y;

    if (x == 0 && y == 0) {
      ++zero;
      continue;
    }

    ll g = gcd(x, y);
    x /= g;
    y /= g;

    if (y < 0) { x = -x, y = -y; }
    if (y == 0 && x < 0) x = -x, y = -y;
    bool rot = x <= 0;
    if (rot) {
      ll temp = x;
      x = y;
      y = -temp;
    }

    if (rot)
      ++mp[{x, y}].first;
    else
      ++mp[{x, y}].second;
  }

  mint ans = 1;
  for (auto p : mp) {
    int s = p.second.first;
    int t = p.second.second;

    mint now = 1;
    now += mint(2).pow(s) - 1;
    now += mint(2).pow(t) - 1;
    ans *= now;
  }

  ans -= 1;
  ans += zero;

  cout << ans << '\n';

  return 0;
}
