#include <bits/stdc++.h>
using namespace std;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using minPQ = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
          dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
inline bool inside(int y, int x, int H, int W) {
  return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
  int x;
  cin >> x;
  return x;
}
inline ll IN() {
  ll x;
  cin >> x;
  return x;
}
inline vs split(const string& t, char c) {
  vs v;
  stringstream s(t);
  string b;
  while (getline(s, b, c)) v.emplace_back(b);
  return v;
}
template <typename T>
inline bool chmin(T& a, const T& b) {
  if (a > b) a = b;
  return a > b;
}
template <typename T>
inline bool chmax(T& a, const T& b) {
  if (a < b) a = b;
  return a < b;
}
template <typename T, typename S>
inline void print(const pair<T, S>& p) {
  cout << p.first << " " << p.second << endl;
}
template <typename T>
inline void print(const T& x) {
  cout << x << endl;
}
template <typename T, typename S>
inline void print(const vector<pair<T, S>>& v) {
  for (auto&& p : v) print(p);
}
template <typename T>
inline void print(const vector<T>& v, string s = " ") {
  for (ll i = (0); i < (ll)(v.size()); ++i)
    cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
inline void yesno(bool ok, string yes = "Yes", string no = "No") {
  cout << (ok ? yes : no) << endl;
}
template <uint MD>
struct ModInt {
  using M = ModInt;
  const static M G;
  uint v;
  ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
  M& set_v(uint _v) {
    v = (_v < MD) ? _v : _v - MD;
    return *this;
  }
  explicit operator bool() const { return v != 0; }
  M operator-() const { return M() - *this; }
  M operator+(const M& r) const { return M().set_v(v + r.v); }
  M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
  M operator*(const M& r) const { return M().set_v(uint(ull(v) * r.v % MD)); }
  M operator/(const M& r) const { return *this * r.inv(); }
  M& operator+=(const M& r) { return *this = *this + r; }
  M& operator-=(const M& r) { return *this = *this - r; }
  M& operator*=(const M& r) { return *this = *this * r; }
  M& operator/=(const M& r) { return *this = *this / r; }
  bool operator==(const M& r) const { return v == r.v; }
  M pow(ll n) const {
    M x = *this, r = 1;
    while (n) {
      if (n & 1) r *= x;
      x *= x;
      n >>= 1;
    }
    return r;
  }
  M inv() const { return pow(MD - 2); }
  friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
using Mint = ModInt<1000000007>;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll a[200001];
ll b[200001];
signed main() {
  ll N;
  cin >> N;
  for (ll i = (0); i < (ll)(N); ++i) cin >> a[i] >> b[i];
  ll g;
  for (ll i = (0); i < (ll)(N); ++i) {
    g = gcd(a[i], b[i]);
    a[i] = a[i] / g;
    b[i] = b[i] / g;
    if (a[i] < 0) {
      a[i] = -a[i];
      b[i] = -b[i];
    }
  }
  map<ll, map<ll, ll>> make_pair;
  for (ll i = (0); i < (ll)(N); ++i) {
    make_pair[a[i]][b[i]]++;
  }
  ll cntzz = 0;
  ll cntznz = 0;
  ll cntnzz = 0;
  cntzz = make_pair[0][0];
  Mint ans = (cntzz == N) ? 0 : 1;
  map<ll, map<ll, bool>> mpfound;
  ll aa, bb, vv;
  for (auto itr1 = make_pair.begin(); itr1 != make_pair.end(); ++itr1) {
    aa = itr1->first;
    for (auto itr2 = make_pair[aa].begin(); itr2 != make_pair[aa].end();
         ++itr2) {
      bb = itr2->first;
      vv = itr2->second;
      if (aa == 0 && bb == 0) continue;
      if (aa == 0 && bb != 0) cntznz++;
      if (aa != 0 && bb == 0) cntnzz++;
      if (aa != 0 && bb != 0) {
        if (bb > 0 && make_pair[bb][-aa] != 0) {
          if (!mpfound[aa][bb] && !mpfound[bb][-aa]) {
            Mint v1 = 2;
            Mint v2 = 2;
            v1 = v1.pow(make_pair[aa][bb]) - 1;
            v2 = v2.pow(make_pair[bb][-aa]) - 1;
            ans *= (v1 + v2 + 1);
          }
        } else if (bb < 0 && make_pair[-bb][aa] != 0) {
          if (!mpfound[aa][bb] && !mpfound[-bb][aa]) {
            Mint v1 = 2;
            Mint v2 = 2;
            v1 = v1.pow(make_pair[aa][bb]) - 1;
            v2 = v2.pow(make_pair[-bb][aa]) - 1;
            ans *= (v1 + v2 + 1);
          }
        } else {
          ans *= 2;
        }
      }
      mpfound[aa][bb] = true;
    }
  }
  Mint v1 = 2;
  Mint v2 = 2;
  v1 = v1.pow(cntznz) - 1;
  v2 = v2.pow(cntnzz) - 1;
  ans *= (v1 + v2 + 1);
  if (ans == 0) {
    print(0);
  } else {
    print(ans - 1);
  }
  return 0;
}
