#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using P = pair<int, int>;

const int mod = 1000000007;
struct mint
{
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a)
  {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a)
  {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a)
  {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const
  {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }

int main() {
    int n;
    cin >> n;

    int zero = 0;
    map<pair<ll,ll>,P> m;

    for (int i=0; i<n; i++) {
        ll x, y;
        cin >> x >> y;
        if (x == 0 && y == 0) {
            zero++;
            continue;
        }
        if (y < 0 || (y == 0 && x < 0)) {
            x = -x;
            y = -y;
        }
        ll g = __gcd(x, y);
        x /= g;
        y /= g;
        if (x > 0) {
            m[make_pair(x,y)].first++;
        } else {
            m[make_pair(y,-x)].second++;
        }
    }

    mint ans = 1;
    for (auto i : m) {
        int s = i.second.first;
        int t = i.second.second;
        ans *= (mint(2).pow(s) - 1 + mint(2).pow(t) - 1 + 1);
    }
    ans -= 1;
    ans += zero;
    cout << ans << endl;
}
