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

// エイリアス
using  ll = long signed long;
using ull = long unsigned long;
using  ld = long double;
using   P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;

// 汎用マクロ
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(i,q) for (auto &i : q)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
#define SZ(x) ((int)(x).size())
template <class T>inline bool chmin(T &a, const T b) {if (a > b) { a = b; return true;} return false;}
template <class T>inline bool chmax(T &a, const T b) {if (a < b) { a = b; return true;} return false;}
template <class T>inline void line_out(const vector<T> vec) {int n = SZ(vec); rep(i, n) { cout << vec[i]; if(i < n-1) cout << " ";}cout << endl;}
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 60;
const int mod = 1000000007;
//const int mod = 998244353;
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
  {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const
  {
    mint res(*this);
    return res -= a;
  }
  mint &operator++()
  {
    if ((x += 1) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator--()
  {
    if ((x += mod - 1) >= mod)
      x -= mod;
    return *this;
  }
  mint operator*(const mint a) const
  {
    mint res(*this);
    return res *= 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
  {
    mint res(*this);
    return res /= a;
  }
};

ll modpow(ll a, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

int main()
{
  int n; cin >> n;
  map<llP, ll> fish;
  int zero = 0;
  rep(i, n) {
    ll a, b; cin >> a >> b;
    if(a == 0 && b == 0) {
      ++zero;
      continue;
    }
    if(a == 0) {
      ++fish[llP(0, 1)];
      continue;
    }
    else if(b == 0) {
      ++fish[llP(1, 0)];
      continue;
    }
    else {
      ll g = __gcd(abs(a), abs(b));
      a /= g;
      b /= g;

      if(b < 0) {
        a *= -1;
        b *= -1;
      }
      ++fish[llP(a, b)];
    }
  }

  mint ans = modpow(2, fish[llP(0, 1)]) + modpow(2, fish[llP(1, 0)]) -1;
  fish[llP(0, 1)] = fish[llP(1, 0)] = 0;

  for(auto mp : fish) {
    ll a = mp.first.first;
    ll b = mp.first.second;

    ll p = mp.second;
    fish[llP(a, b)] = 0;

    ll q;
    if(a < 0) {
      q = fish[llP(b, -a)];
      fish[llP(b, -a)] = 0;
    }
    else {
      q = fish[llP(-b, a)];
      fish[llP(-b, a)] = 0;
    }
    ans *= modpow(2, p) + modpow(2, q) - 1;
  }
  --ans;
  ans += zero;

  cout << ans.x << endl;
}


Measured memory_bytes: 28524