#include <bits/stdc++.h>
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
using ll = long long;
using ld = long double;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
long long modpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
map<tuple<ll, ll, ll>, ll> p;
int main() {
  ll n, m = 0, pm, x, y, ans = 1;
  cin >> n;
  for (ll i = ll(0); i < ll(n); i++) {
    pm = 0;
    cin >> x >> y;
    if ((y < 0 && x >= 0) || (y >= 0 && x < 0)) {
      y = labs(y);
      x = labs(x);
      pm = 1;
    }
    if (x == 0 && y == 0)
      m++;
    else if (y == 0)
      p[{1, 0, 0}]++;
    else {
      p[{x / gcd(x, y), y / gcd(x, y), pm}]++;
    }
  }
  for (map<tuple<ll, ll, ll>, ll>::iterator it = p.begin(); it != p.end();
       it++) {
    tuple<ll, ll, ll> f = it->first;
    ll g = it->second;
    ll s1 = get<0>(f), s2 = get<1>(f), s3 = get<2>(f);
    ll pm2;
    if (s3 == 0)
      pm2 = 1;
    else
      pm2 = 0;
    ll g2 = p[{s2, s1, pm2}];
    ans = (ans * ((modpow(2, g) + modpow(2, g2) - 1) % mod)) % mod;
    p[f] = 0, p[{s2, s1, pm2}] = 0;
  }
  cout << (ans - 1 + m + mod) % mod << endl;
}
