#include <bits/stdc++.h>
#pragma GCC optimize("O3")
long mod(long a) {
  long long c = a % (long long)(1e9 + 7);
  if (c >= 0) return c;
  return c + (long long)(1e9 + 7);
}
long long po(long a, long b) {
  if (b == 0) {
    return 1;
  }
  long long z = po(a, b / 2);
  z = mod(z * z);
  if (b % 2 != 0) {
    z = mod(a * z);
  }
  return z;
}
bool prime_(int n) {
  if (n == 1) {
    return false;
  } else if (n == 2) {
    return true;
  } else {
    for (int i = 2; i <= std::sqrt(n); i++) {
      if (n % i == 0) {
        return false;
      }
    }
    return true;
  }
}
long long gcd_(long long a, long long b) {
  if (a < b) {
    std::swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd_(b, a % b);
  }
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
int main() {
  using namespace std;
  long long n;
  cin >> n;
  long long a[n], b[n];
  for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
  map<pair<long long, long long>, long long> cnt;
  for (long long i = 0; i < n; i++) {
    if (a[i] == 0LL && b[i] == 0LL) {
      cnt[pair<long long, long long>(a[i], b[i])]++;
      continue;
    }
    if (a[i] == 0LL) {
      cnt[pair<long long, long long>(0LL, 1LL)]++;
      continue;
    }
    if (b[i] == 0) {
      cnt[pair<long long, long long>(1LL, 0LL)]++;
      continue;
    }
    long long g = gcd_(abs(a[i]), abs(b[i]));
    a[i] /= g;
    b[i] /= g;
    if (a[i] < 0) {
      a[i] = 0LL - a[i];
      b[i] = 0LL - b[i];
    }
    cnt[pair<long long, long long>(a[i], b[i])]++;
  }
  long long ans = 1;
  for (auto p : cnt) {
    if (p.second < 0) continue;
    long long coA = p.first.second;
    long long coB = -p.first.first;
    if (coA < 0) {
      coA = 0LL - coA;
      coB = 0LL - coB;
    }
    long long coeff =
        mod(po(2LL, p.second) +
            po(2LL, cnt[pair<long long, long long>(coA, coB)]) - 1);
    cnt[pair<long long, long long>(coA, coB)] = -1;
    ans *= coeff;
    ans = mod(ans);
  }
  ans -= 1;
  ans = mod(ans);
  cout << ans << endl;
  return 0;
}
