#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
const int M = 1000000007;
ll mul(ll a, ll b) { return (a * b) % M; }
ll mod_pow(ll a, ll b) {
  ll r = 1;
  while (b) {
    if (b & 1) r = mul(r, a);
    b >>= 1;
    a = mul(a, a);
  }
  return r;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n, zero = 0;
  cin >> n;
  map<pair<ll, ll>, P> mp;
  for (int i = 0; i < (int)(n); ++i) {
    ll x, y;
    cin >> x >> y;
    ll g = gcd(x, y);
    x /= g;
    y /= g;
    if (x == 0 && y == 0) {
      ++zero;
      continue;
    }
    if (y < 0) {
      x = -x;
      y = -y;
    }
    if (y == 0) x = abs<ll>(x);
    bool r = (x <= 0);
    if (r) {
      ll tmp = x;
      x = y;
      y = -tmp;
    }
    if (r)
      mp[{x, y}].first++;
    else
      mp[{x, y}].second++;
  }
  ll ans = 1;
  for (auto k : mp) {
    ll now = 1;
    ll now1 = mod_pow(2, k.second.first) - 1;
    ll now2 = mod_pow(2, k.second.second) - 1;
    now = (now + now1 + now2) % M;
    ans = mul(ans, now);
  }
  cout << (ans - 1 + zero) << endl;
}
