#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
  long long x;
  mint(long long 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(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  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; }
struct Combination {
  vector<mint> fact, ifact;
  Combination(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
} comb(200009);
using P = pair<ll, ll>;
map<P, int> mp;
int acnt = 0, bcnt = 0;
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < (int)(n); ++i) {
    ll a, b;
    cin >> a >> b;
    if (a == 0 && b == 0) {
      if (n != 1) continue;
      cout << 1 << endl;
      return (0);
    }
    if (a == 0) {
      acnt++;
    } else if (b == 0) {
      bcnt++;
    } else {
      if (a < 0 && b < 0) {
        a *= -1, b *= -1;
      } else if (a > 0 && b < 0) {
        a *= -1, b *= -1;
      }
    }
    mp[P(a, b)]++;
  }
  mint ans = 1;
  for (auto x : mp) {
    P p = x.first;
    ll a = p.first, b = p.second;
    if (a > 0 && b > 0) break;
    int s = x.second;
    int t = mp[P(b, -a)];
    ans *= (mint(2).pow(s) + mint(2).pow(t) - 1);
  }
  ans *= (mint(2).pow(acnt) + mint(2).pow(bcnt) - 1);
  cout << ans - 1 << endl;
  return (0);
}
