#include <bits/stdc++.h>
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll gcd(ll n, ll m) {
  ll tmp;
  while (m != 0) {
    tmp = n % m;
    n = m;
    m = tmp;
  }
  return n;
}
ll lcm(ll n, ll m) { return abs(n) / gcd(n, m) * abs(m); }
using namespace std;
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
using P = pair<ll, ll>;
void solve() {
  int n;
  cin >> n;
  ll zero = 0, z = 0, z2 = 0;
  vector<ll> a(n), b(n);
  for (int i = (int)0; i < (int)n; ++i) cin >> a[i] >> b[i];
  map<P, ll> mp, mp2, mp3;
  for (int i = (int)0; i < (int)n; ++i) {
    if ((a[i] != 0) && (b[i] != 0)) {
      ll x = gcd(abs(a[i]), abs(b[i]));
      mp[P{a[i] / x, b[i] / x}]++;
      mp2[P{-b[i] / x, a[i] / x}]++;
      mp3[P{b[i] / x, -a[i] / x}]++;
    } else if ((a[i] == 0) && (b[i] == 0)) {
      ++zero;
    } else if (a[i] == 0) {
      z++;
    } else {
      z2++;
    }
  }
  modint ans = 1;
  ll cnt = 0;
  for (auto x : mp) {
    if (x.second == 0) {
      continue;
    }
    if (mp2.count(x.first)) {
      modint s = 2;
      s = s.pow(x.second);
      modint t = 2;
      t = t.pow(mp2[x.first]);
      ans *= (s + t - 1);
      mp[P{-x.first.second, x.first.first}] = 0;
    }
  }
  for (int i = (int)0; i < (int)n; ++i) {
    if ((a[i] == 0) || (b[i] == 0)) {
      continue;
    }
    ll x = gcd(abs(a[i]), abs(b[i]));
    if ((!mp2.count(P{a[i] / x, b[i] / x})) &&
        (!mp3.count(P{a[i] / x, b[i] / x}))) {
      ++cnt;
    }
  }
  modint x = 2;
  x = x.pow(cnt);
  ans *= x;
  x = 2;
  x = x.pow(z);
  modint y = 2;
  y = y.pow(z2);
  ans *= (x + y - 1);
  ans -= zero;
  ans -= 1;
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
