#include <bits/stdc++.h>
using namespace std;
const double pi = M_PI;
const int INF10 = 1000000001, ID_MAX = 20;
const long long INF18 = 1e18 + 1;
const int mod = 1000000007;
struct edge {
  int to;
  long cost;
};
void sort2array(double *a, long *b, long n) {
  for (int i = 0; i < n; i++) {
    b[i] = i;
  }
  sort(b, b + n, [a](long i, long j) -> bool { return a[i] < a[j]; });
}
int wtover(int a, int b) {
  if (a % b > 0)
    return (a / b) + 1;
  else
    return a / b;
}
int bi_e[ID_MAX] = {0};
int bi_max(long n) {
  int m = 0;
  for (m; (1 << m) <= n; m++)
    ;
  m = m - 1;
  return m;
}
void bi_exs(long n) {
  memset(bi_e, 0, sizeof(bi_e));
  if (n < (1 << ID_MAX)) {
    for (int i = 0; n > 0; n = (n >> 1), i++) bi_e[i] = n & 1;
  }
}
long myPow(long x, long n, long m = mod) {
  if (n < 0) return 0;
  if (n == 0) return 1;
  if (n % 2 == 0)
    return myPow(x * x % m, n / 2, m);
  else
    return x * myPow(x, n - 1, m) % m;
}
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; }
struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};
struct divNum {
  vector<vector<mint>> d;
  int N, M;
  divNum(int n, int m, bool tof) : d(n + 1, vector<mint>(m + 1, 0)) {
    N = n;
    M = m;
    if (tof) {
      for (int j = 0; j < (int)(n + 1); j++) {
        d[j][0] = 1;
      }
      for (int j = 0; j < (int)(m); j++) {
        d[0][j + 1] = 0;
      }
      for (int j = 1; j <= n; j++) {
        for (int k = 1; k <= m; k++) {
          if (j > k)
            d[j][k] = d[j - 1][k];
          else
            d[j][k] = d[j - 1][k] + d[j][k - j];
        }
      }
    } else {
      d[0][0] = 1;
      for (int i = 0; i < (int)(n); i++) {
        for (int j = 0; j < (int)(m + 1); j++) {
          for (int k = 0; k < (int)(m - j + 1); k++) {
            d[i + 1][j + k] = d[i + 1][j + k] + d[i][j];
          }
        }
      }
    }
  }
  mint operator()(int n, int m) {
    if (n < 0 || m < 0 || n > N || m > M)
      return 0;
    else {
      return d[n][m];
    }
  }
};
long long euclidean_gcd(long long a, long long b) {
  a = abs(a);
  b = abs(b);
  if (a < b) return euclidean_gcd(b, a);
  long long r;
  while ((r = a % b)) {
    a = b;
    b = r;
  }
  return b;
}
const int N_MAX = 200001;
long long s[N_MAX];
int n;
int main() {
  int i;
  long long x, y;
  cin >> n;
  for (int i = 0; i < (int)(n); i++) {
    cin >> x >> y;
    long long a = euclidean_gcd(x, y);
    x = x / a;
    y = y / a;
    s[i] = x * y;
  }
  sort(s, s + n);
  mint ans = 0;
  for (int i = 0; i < n; i = upper_bound(s, s + n, s[i]) - s) {
    int scou = upper_bound(s, s + n, s[i]) - lower_bound(s, s + n, s[i]);
    int ecou =
        upper_bound(s, s + n, -1 * s[i]) - lower_bound(s, s + n, -1 * s[i]);
    ans += (myPow(2, scou) - 1) * myPow(2, n - scou - ecou);
  }
  cout << ans.x << endl;
}
