#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
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; }
mint modPow(mint a, int n) {
  if (n == 0) return 1;
  if (n == 1) return a;
  if (n % 2)
    return a * modPow(a, n - 1);
  else
    return modPow(a * a, n / 2);
}
long long gcd(long long a, long long b) {
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
int main() {
  int n;
  cin >> n;
  int cntz = 0;
  map<pair<long long, long long>, pair<int, int> > mp;
  for (int i = 0; i < (int)n; i++) {
    long long x, y;
    cin >> x >> y;
    if (x == 0 && y == 0) {
      cntz++;
      continue;
    }
    long long g = gcd(x, y);
    x /= g;
    y /= g;
    if (y < 0) x = -x, y = -y;
    if (y == 0 && x < 0) x = -x;
    bool rot = false;
    if (x <= 0) {
      rot = true;
      swap(x, y);
      y = -y;
    }
    if (rot)
      mp[pair<long long, long long>(x, y)].first++;
    else
      mp[pair<long long, long long>(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 += cntz;
  cout << ans << endl;
}
