#include <bits/stdc++.h>
using namespace std;
inline long long modpow(long long x, long long y,
                        long long m = (long long)((1e9) + 7)) {
  long long res = 1;
  while (y) {
    if (y & 1) {
      res *= x;
      res %= m;
    }
    x = x * x % m;
    y /= 2;
  }
  return res;
}
long long mypow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y % 2) {
      res *= x;
    }
    x = x * x;
    y /= 2;
  }
  return res;
}
bool prime(long long x) {
  for (long long i = 2; i * i <= x; i++) {
    if (!(x % i)) {
      return false;
    }
  }
  return true;
}
inline long long gcd(long long x, long long y) {
  if (!y) {
    return x;
  }
  return gcd(y, x % y);
}
long long keta(long long x) {
  long long ans = 0;
  while (x) {
    x /= 10;
    ans++;
  }
  return ans;
}
long long ketasum(long long x) {
  long long ans = 0;
  while (x) {
    ans += x % 10;
    x /= 10;
  }
  return ans;
}
inline long long lcm(long long x, long long y) {
  long long ans = x / gcd(x, y) * y;
  return ans;
}
long long twobeki(long long x) {
  long long ans = 0;
  while (1) {
    if (!(x & 1)) {
      ans++;
      x /= 2;
    } else {
      break;
    }
  }
  return ans;
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
long long kai(long long x, long long y) {
  long long res = 1;
  for (long long i = x - y + 1; i <= x; i++) {
    res *= i;
    res %= (long long)((1e9) + 7);
  }
  return res;
}
long long comb(long long x, long long y) {
  if (y > x) return 0;
  return kai(x, y) * modpow(kai(y, y), (long long)((1e9) + 7) - 2) %
         (long long)((1e9) + 7);
}
template <typename T, typename U>
class SegTree {
 protected:
  unsigned long long n = 1, rank = 0;
  std::vector<T> node;
  T nodee;
  virtual T nodef(const T&, const T&) const = 0;

 public:
  SegTree(unsigned long long m, T init, T nodee) : nodee(nodee) {
    while (n < m) {
      n *= 2;
      rank++;
    }
    node.resize(2 * n);
    for (unsigned long long i = n; i < 2 * n; i++) node[i] = init;
  }
  SegTree(const std::vector<T>& initvec, T nodee) : nodee(nodee) {
    unsigned long long m = initvec.size();
    while (n < m) {
      n *= 2;
      rank++;
    }
    node.resize(2 * n);
    for (unsigned long long i = n; i < 2 * n; i++) {
      if (i - n < m) node[i] = initvec[i - n];
    }
  }
  virtual void update(long long i, U x) {
    i += n;
    node[i] = x;
    while (i != 1) {
      i >>= 1;
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
  }
  virtual T query(long long l, long long r) {
    l += n;
    r += n;
    long long ls = nodee, rs = nodee;
    while (l < r) {
      if (l & 1) {
        ls = nodef(ls, node[l]);
        l++;
      }
      if (r & 1) {
        r--;
        rs = nodef(node[r], rs);
      }
      l >>= 1;
      r >>= 1;
    }
    return nodef(ls, rs);
  }
  virtual T operator[](const long long& x) { return node[n + x]; }
  void fill(T x) { std::fill(all(node), x); }
  void print() {
    for (long long i = 0; i < n; i++) std::cout << operator[](i) << " ";
    std::cout << std::endl;
  }
};
class RSQ : public SegTree<long long, long long> {
  long long nodef(const long long& lhs, const long long& rhs) {
    return lhs + rhs;
  }

 public:
  RSQ(long long size, const long long& def = 0)
      : SegTree<long long, long long>(size, def, 0) {}
  RSQ(const std::vector<long long>& initvec)
      : SegTree<long long, long long>(initvec, 0) {}
};
class RMiQ : public SegTree<long long, long long> {
  long long nodef(const long long& lhs, const long long& rhs) {
    return std::min(lhs, rhs);
  }

 public:
  RMiQ(long long size, const long long& def = 0)
      : SegTree<long long, long long>(size, def, 0) {}
  RMiQ(const std::vector<long long>& initvec)
      : SegTree<long long, long long>(initvec, 0) {}
};
class RMaQ : public SegTree<long long, long long> {
  long long nodef(const long long& lhs, const long long& rhs) {
    return std::max(lhs, rhs);
  }

 public:
  RMaQ(long long size, const long long& def = 0)
      : SegTree<long long, long long>(size, def, 0) {}
  RMaQ(const std::vector<long long>& initvec)
      : SegTree<long long, long long>(initvec, 0) {}
};
template <typename T, typename U>
class IntervalSegTree : public SegTree<T, U> {
 protected:
  using SegTree<T, U>::n;
  using SegTree<T, U>::rank;
  using SegTree<T, U>::node;
  using SegTree<T, U>::nodef;
  using SegTree<T, U>::nodee;
  std::vector<U> lazy;
  std::vector<bool> lazyflag;
  std::vector<long long> width;
  virtual void lazyf(U&, const U&) = 0;
  virtual void updf(T&, const U&, const unsigned long long&) = 0;
  void eval(long long k) {
    for (long long i = rank; i > 0; i--) {
      long long nk = k >> i;
      if (lazyflag[nk]) {
        updf(node[2 * nk], lazy[nk], width[2 * nk]);
        updf(node[2 * nk + 1], lazy[nk], width[2 * nk + 1]);
        if (lazyflag[2 * nk])
          lazyf(lazy[2 * nk], lazy[nk]);
        else
          lazy[2 * nk] = lazy[nk];
        if (lazyflag[2 * nk + 1])
          lazyf(lazy[2 * nk + 1], lazy[nk]);
        else
          lazy[2 * nk + 1] = lazy[nk];
        lazyflag[2 * nk] = lazyflag[2 * nk + 1] = true;
        lazyflag[nk] = false;
      }
    }
  }

 public:
  IntervalSegTree(unsigned long long m, T init, T nodee)
      : SegTree<T, U>(m, init, nodee) {
    lazy.resize(2 * n);
    lazyflag.resize(2 * n);
    width.resize(2 * n);
    width[1] = n;
    for (unsigned long long i = 2; i < 2 * n; i++) {
      width[i] = width[i >> 1] >> 1;
    }
  }
  IntervalSegTree(T nodee, const std::vector<T>& initvec)
      : SegTree<T, U>(initvec, nodee) {
    lazy.resize(2 * n);
    lazyflag.resize(2 * n);
    width.resize(2 * n);
    width[1] = n;
    for (unsigned long long i = 2; i < 2 * n; i++) {
      width[i] = width[i >> 1] >> 1;
    }
  }
  void update(long long i, U x) {
    i += n;
    eval(i);
    updf(node[i], x, width[i]);
    if (lazyflag[i])
      lazyf(lazy[i], x);
    else {
      lazyflag[i] = true;
      lazy[i] = x;
    }
    while (i /= 2) node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
  void update(long long l, long long r, U x) {
    l += n;
    r += n;
    long long nl = l, nr = r;
    while (!(nl & 1)) nl >>= 1;
    while (!(nr & 1)) nr >>= 1;
    nr--;
    eval(nl);
    eval(nr);
    while (l < r) {
      if (l & 1) {
        updf(node[l], x, width[l]);
        if (lazyflag[l])
          lazyf(lazy[l], x);
        else {
          lazyflag[l] = true;
          lazy[l] = x;
        }
        l++;
      }
      if (r & 1) {
        r--;
        updf(node[r], x, width[r]);
        if (lazyflag[r])
          lazyf(lazy[r], x);
        else {
          lazyflag[r] = true;
          lazy[r] = x;
        }
      }
      l >>= 1;
      r >>= 1;
    }
    while (nl >>= 1) node[nl] = nodef(node[2 * nl], node[2 * nl + 1]);
    while (nr >>= 1) node[nr] = nodef(node[2 * nr], node[2 * nr + 1]);
  }
  T query(long long l, long long r) {
    l += n;
    r += n;
    eval(l);
    eval(r - 1);
    long long ls = nodee, rs = nodee;
    while (l < r) {
      if (l & 1) {
        ls = nodef(ls, node[l]);
        l++;
      }
      if (r & 1) {
        r--;
        rs = nodef(node[r], rs);
      }
      l >>= 1;
      r >>= 1;
    }
    return nodef(ls, rs);
  }
  T operator[](const long long& x) {
    eval(n + x);
    return node[n + x];
  }
  T queryForAll() { return node[1]; }
};
class RAQRSQ : public IntervalSegTree<long long, long long> {
  long long nodef(const long long& a, const long long& b) const {
    return a + b;
  }
  void lazyf(long long& a, const long long& b) { a += b; }
  void updf(long long& a, const long long& b, const unsigned long long& width) {
    a += width * b;
  }

 public:
  RAQRSQ(long long size, const long long& def = 0)
      : IntervalSegTree<long long, long long>(size, def, 0) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
  RAQRSQ(const std::vector<long long>& initvec)
      : IntervalSegTree<long long, long long>((long long)0, initvec) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
};
class RAQRMiQ : public IntervalSegTree<long long, long long> {
  long long nodef(const long long& a, const long long& b) const {
    return std::min(a, b);
  }
  void lazyf(long long& a, const long long& b) { a += b; }
  void updf(long long& a, const long long& b, const unsigned long long& width) {
    a += b;
  }

 public:
  RAQRMiQ(long long size, const long long& def = 0)
      : IntervalSegTree<long long, long long>(size, def, (long long)(3e18)) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
  RAQRMiQ(const std::vector<long long>& initvec)
      : IntervalSegTree<long long, long long>((long long)(3e18), initvec) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
};
class RAQRMaQ : public IntervalSegTree<long long, long long> {
  long long nodef(const long long& a, const long long& b) const {
    return std::max(a, b);
  }
  void lazyf(long long& a, const long long& b) { a += b; }
  void updf(long long& a, const long long& b, const unsigned long long& width) {
    a += b;
  }

 public:
  RAQRMaQ(unsigned long long size, const long long& def = 0)
      : IntervalSegTree<long long, long long>(size, def, -(long long)(3e18)) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
  RAQRMaQ(const std::vector<long long>& initvec)
      : IntervalSegTree<long long, long long>(-(long long)(3e18), initvec) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
};
class RUQRSQ : public IntervalSegTree<long long, long long> {
  long long nodef(const long long& a, const long long& b) const {
    return a + b;
  }
  void lazyf(long long& a, const long long& b) { a = b; }
  void updf(long long& a, const long long& b, const unsigned long long& width) {
    a = width * b;
  }

 public:
  RUQRSQ(long long size, const long long& def = 0)
      : IntervalSegTree<long long, long long>(size, def, 0) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
  RUQRSQ(const std::vector<long long>& initvec)
      : IntervalSegTree<long long, long long>((long long)0, initvec) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
};
class RUQRMiQ : public IntervalSegTree<long long, long long> {
  long long nodef(const long long& a, const long long& b) const {
    return std::min(a, b);
  }
  void lazyf(long long& a, const long long& b) { a = b; }
  void updf(long long& a, const long long& b, const unsigned long long& width) {
    a = b;
  }

 public:
  RUQRMiQ(long long size, const long long& def = 0)
      : IntervalSegTree<long long, long long>(size, def, (long long)(3e18)) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
  RUQRMiQ(const std::vector<long long>& initvec)
      : IntervalSegTree<long long, long long>((long long)(3e18), initvec) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
};
class RUQRMaQ : public IntervalSegTree<long long, long long> {
  long long nodef(const long long& a, const long long& b) const {
    return std::max(a, b);
  }
  void lazyf(long long& a, const long long& b) { a = b; }
  void updf(long long& a, const long long& b, const unsigned long long& width) {
    a = b;
  }

 public:
  RUQRMaQ(long long size, const long long& def = 0)
      : IntervalSegTree<long long, long long>(size, def, -(long long)(3e18)) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
  RUQRMaQ(const std::vector<long long>& initvec)
      : IntervalSegTree<long long, long long>(-(long long)(3e18), initvec) {
    for (long long i = n - 1; i > 0; i--)
      node[i] = nodef(node[2 * i], node[2 * i + 1]);
  }
};
class Union_Find {
  vector<long long> par;
  vector<long long> rankmy;
  vector<long long> ookisa;

 public:
  Union_Find(long long size) {
    par = vector<long long>(size);
    rankmy = vector<long long>(size);
    ookisa = vector<long long>(size);
    for (long long i = 0; i < size; i++) {
      par[i] = i;
      ookisa[i] = 1;
    }
  }
  long long find(long long x) {
    if (par[x] == x) {
      return x;
    }
    return par[x] = find(par[x]);
  }
  void unite(long long x, long long y) {
    x = find(x);
    y = find(y);
    if (x == y) {
      return;
    }
    if (rankmy[x] < rankmy[y]) {
      par[x] = y;
      ookisa[y] += ookisa[x];
      ookisa[x] = 0;
    } else {
      par[y] = x;
      ookisa[x] += ookisa[y];
      ookisa[y] = 0;
      if (rankmy[x] == rankmy[y]) {
        rankmy[x]++;
      }
    }
  }
  long long size(long long i) {
    i = find(i);
    return ookisa[i];
  }
  bool same(long long x, long long y) { return find(x) == find(y); }
};
long long perm[1000005];
void init_perm() {
  perm[0] = 1;
  for (long long i = 1; i <= 1000000; i++) {
    perm[i] = perm[i - 1] * i % (long long)((1e9) + 7);
  }
}
long long nCk(long long x, long long y) {
  return perm[x] * modpow(perm[x - y], (long long)((1e9) + 7) - 2) %
         (long long)((1e9) + 7) * modpow(perm[y], (long long)((1e9) + 7) - 2) %
         (long long)((1e9) + 7);
}
double kyori(pair<long long, long long> f, pair<long long, long long> s) {
  double ans = 0;
  double t = fabs(f.first - s.first);
  double y = fabs(f.second - s.second);
  ans = sqrt(t * t + y * y);
  return ans;
}
inline string stringmax(string& x, string& y) {
  if (x.size() > y.size()) {
    return x;
  }
  if (x.size() < y.size()) {
    return y;
  }
  for (long long i = 0; i < x.size(); i++) {
    if (x[i] > y[i]) {
      return x;
    }
    if (x[i] < y[i]) {
      return y;
    }
  }
  return x;
}
long long n, a[200004], b[200004], dame, ans, cnt, kake, k;
map<pair<long long, long long>, long long> mp;
signed main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  cin >> n;
  k = n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
    if (!a[i] && !b[i]) {
      k--;
      dame++;
      continue;
    }
    long long g = gcd(abs(a[i]), abs(b[i]));
    a[i] /= g;
    b[i] /= g;
    if (a[i] >= 0 && b[i] < 0) {
      a[i] = -a[i];
      b[i] = abs(b[i]);
    }
    if (!(signbit(a[i]) ^ signbit(b[i]))) {
      a[i] = abs(a[i]);
      b[i] = abs(b[i]);
    }
    mp[{a[i], b[i]}]++;
  }
  n = k;
  ans = 1;
  for (auto& i : mp) {
    if (signbit(i.first.first) ^ signbit(i.first.second)) {
      long long f = modpow(2, i.second);
      f += (long long)((1e9) + 7);
      f--;
      f %= (long long)((1e9) + 7);
      pair<long long, long long> p = {-i.first.second, i.first.first};
      if (!(signbit(p.first) ^ signbit(p.second))) {
        p.first = abs(p.first);
        p.second = abs(p.second);
      } else if (p.second < 0 && p.first >= 0) {
        p.first = -p.first;
        p.second = abs(p.second);
      }
      if (!mp.count(p)) {
        continue;
      }
      auto& x = mp[p];
      long long s = modpow(2, x);
      f += s;
      f %= (long long)((1e9) + 7);
      ans *= f;
      ans %= (long long)((1e9) + 7);
      cnt += i.second;
      cnt += x;
    }
  }
  ans *= modpow(2, n - cnt);
  ans--;
  ans %= (long long)((1e9) + 7);
  cout << (ans + dame) % (long long)((1e9) + 7) << "\n";
}
