#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vvp = vector<vector<pair<int, int>>>;
template <typename T>
using ve = vector<T>;
template <typename T>
using pq2 = priority_queue<T>;
template <typename T>
using pq1 = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return a * b / gcd(a, b);
}
template <typename T>
T extgcd(T a, T b, T& x, T& y) {
  T d = a;
  if (b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else
    x = 1, y = 0;
  return d;
}
template <typename T>
T modpow(T x, T n, T m) {
  if (n == 0) return 1;
  T resp = modpow(x * x % m, n / 2, m);
  if (n & 1) resp = resp * x % m;
  return resp;
}
template <typename T>
T modinverse(T a, T m) {
  T x, y;
  extgcd(a, m, x, y);
  return (m + x % m) % m;
}
struct combination {
  ll M = 1000000007;
  vector<ll> fact, ifact;
  combination(ll n) : fact(n + 1), ifact(n + 1) {
    fact[0] = 1;
    ifact[0] = 1;
    for (ll i = 0; i < n; i++) {
      fact[i + 1] = fact[i] * (i + 1) % M;
      ifact[i + 1] = ifact[i] * modpow(i + 1, M - 2, M) % M;
    }
  }
  ll com(ll a, ll b) {
    if (a == 0 && b == 0) return 1;
    if (a < b || a < 0) return 0;
    ll tmp = ifact[a - b] * ifact[b] % M;
    return tmp * fact[a] % M;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin >> N;
  vl A(N), B(N);
  for (int i = 0; i < (N); i++) cin >> A[i] >> B[i];
  for (int i = 0; i < (N); i++) {
    ll a = A[i], b = B[i];
    if (a >= 0 && b >= 0) {
      ll c = gcd(a, b);
      a /= c, b /= c;
    } else if (a >= 0 && b <= 0) {
      ll c = gcd(a, -b);
      a /= c, b /= c;
    } else if (a <= 0 && b >= 0) {
      ll c = gcd(-a, b);
      a /= c, b /= c;
      a = -a;
      b = -b;
    } else {
      ll c = gcd(-a, -b);
      a /= c, b /= c;
      a = -a, b = -b;
    }
    A[i] = a, B[i] = b;
  }
  map<pll, ll> D;
  for (int i = 0; i < (N); i++) D[{A[i], B[i]}]++;
  ve<pll> E;
  set<pll> F;
  for (auto p : D) {
    if (F.count(p.first)) continue;
    ll a1 = p.second;
    ll a2 = 0;
    if (D.count({p.first.second, -p.first.first})) {
      a2 = D[{p.first.second, -p.first.first}];
      F.insert({p.first.second, -p.first.first});
    } else if (D.count({-p.first.second, p.first.first})) {
      a2 = D[{-p.first.second, p.first.first}];
      F.insert({-p.first.second, p.first.first});
    }
    F.insert(p.first);
    E.push_back({a1, a2});
  }
  ll ans = 1;
  for (pll p : E) {
    ll aa = modpow((ll)2, p.first, (ll)1000000007) +
            modpow((ll)2, p.second, (ll)1000000007) - 1;
    aa %= 1000000007;
    ans *= aa;
    ans %= 1000000007;
  }
  cout << (ans + 1000000007 - 1) % 1000000007 << endl;
  return 0;
}
