#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
struct mint {
  long long x;
  mint(long long 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(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  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() {
  long long n;
  cin >> n;
  vector<long long> A(n);
  vector<long long> B(n);
  map<double, long long> data;
  map<double, long long> data2;
  for (int i = 0; i < (n); ++i) {
    cin >> A[i] >> B[i];
    data[A[i] / (double)B[i]] += 1;
    data2[A[i] / (double)B[i]] = 1;
  }
  mint ans = 1;
  for (auto x : data) {
    if (data2[x.first] == -1) {
      continue;
    }
    int u = data[-1 / x.first];
    ans *= mint(2).pow(x.second) - 1 + mint(2).pow(u);
    data2[x.first] = -1;
    data2[-1 / x.first] = -1;
  }
  cout << ans.x - 1;
}
