#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <typename T>
void MACRO_OUT(const T t) {
  std::cout << t;
}
template <typename First, typename... Rest>
void MACRO_OUT(const First first, const Rest... rest) {
  std::cout << first << " ";
  MACRO_OUT(rest...);
}
template <class S, class T, class U>
bool IN(S a, T x, U b) {
  return a <= x && x < b;
}
template <class T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
template <class T>
using V = std::vector<T>;
template <class T>
using VV = V<V<T>>;
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using i64 = std::int_fast64_t;
using u64 = std::uint_fast64_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<i64, i64>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double eps = 1e-6;
constexpr i64 MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N>
void FILL(T (&a)[N], const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T& val) {
  for (auto& b : a) FILL(b, val);
}
template <class T>
void FILL(std::vector<T>& a, const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>>& a, const T& val) {
  for (auto& b : a) FILL(b, val);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll powMod(ll n, ll p, ll mod) {
  ll res = 1;
  while (p) {
    if (p & 1) (res *= n) %= mod;
    (n *= n) %= mod;
    p >>= 1;
  }
  return res;
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  int n;
  MACRO_VAR_Scan(n);
  ;
  std::vector<i64> a, b;
  MACRO_VEC_ROW_Init(n, a, b);
  for (int w_ = 0; w_ < n; ++w_) {
    MACRO_VEC_ROW_Scan(w_, a, b);
  };
  std::map<PAIR, int> map;
  i64 ans = 0;
  for (int i = (0); i < (n); ++i) {
    if (a[i] == 0 && b[i] == 0)
      ++ans;
    else {
      if (a[i] == 0) {
        ++map[{0, 1}];
      } else if (b[i] == 0) {
        ++map[{1, 0}];
      } else {
        i64 g = gcd(std::abs(a[i]), std::abs(b[i]));
        a[i] /= g;
        b[i] /= g;
        if (b[i] < 0) {
          a[i] *= -1;
          b[i] *= -1;
        }
        ++map[{a[i], b[i]}];
      }
    }
  }
  auto anti = [&](PAIR p) {
    std::swap(p.first, p.second);
    p.first *= -1;
    if (p.second < 0) {
      p.first *= -1;
      p.second *= -1;
    }
    return p;
  };
  i64 t = 1;
  std::set<PAIR> checked;
  for (auto& p : map) {
    if (checked.count(p.first)) continue;
    checked.insert(p.first);
    auto q = anti(p.first);
    checked.insert(q);
    i64 c = 1;
    (c += powMod(2, p.second, MOD) - 1) %= MOD;
    if (map.count(q)) {
      (c += powMod(2, map[q], MOD) - 1) %= MOD;
    }
    (t *= c) %= MOD;
  }
  (t -= 1) %= MOD;
  if (t < 0) t += MOD;
  (ans += t) %= MOD;
  MACRO_OUT(ans);
  std::cout << "\n";
  ;
  return 0;
}
