#include <bits/stdc++.h>
using namespace std;
using vi = vector<long long>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using vp = vector<pair<long long, long long> >;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
const long long inf = 1001001001001001001;
const long long INF = 1001001001;
const long long mod = 1000000007;
const double eps = 1e-10;
template <class T>
bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
void out(T a) {
  cout << a << '\n';
}
template <class T>
void outp(T a) {
  cout << '(' << a.first << ',' << a.second << ')' << '\n';
}
template <class T>
void outvp(T v) {
  for (long long i = 0; i < (long long)(v.size()); i++)
    cout << '(' << v[i].first << ',' << v[i].second << ')';
  cout << '\n';
}
template <class T>
void outvvp(T v) {
  for (long long i = 0; i < (long long)(v.size()); i++) outvp(v[i]);
}
template <class T>
void outv(T v) {
  for (long long i = 0; i < (long long)(v.size()); i++) {
    if (i) cout << ' ';
    cout << v[i];
  }
  cout << '\n';
}
template <class T>
void outvv(T v) {
  for (long long i = 0; i < (long long)(v.size()); i++) outv(v[i]);
}
template <class T>
bool isin(T x, T l, T r) {
  return (l) <= (x) && (x) <= (r);
}
template <class T>
void yesno(T b) {
  if (b)
    out("yes");
  else
    out("no");
}
template <class T>
void YesNo(T b) {
  if (b)
    out("Yes");
  else
    out("No");
}
template <class T>
void YESNO(T b) {
  if (b)
    out("YES");
  else
    out("NO");
}
template <class T>
void noyes(T b) {
  if (b)
    out("no");
  else
    out("yes");
}
template <class T>
void NoYes(T b) {
  if (b)
    out("No");
  else
    out("Yes");
}
template <class T>
void NOYES(T b) {
  if (b)
    out("NO");
  else
    out("YES");
}
void outs(long long a, long long b) {
  if (a >= inf - 100)
    out(b);
  else
    out(a);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long modpow(long long a, long long b) {
  a %= mod;
  if (b == 0) return 1;
  if (b & 1) return a * modpow(a, b - 1) % mod;
  long long k = modpow(a, b / 2);
  return k * k % mod;
}
int main() {
  long long n;
  cin >> n;
  vector<long double> v;
  long long ans = 0, za = 0, zb = 0;
  for (long long i = 0; i < (long long)(n); i++) {
    long double a, b;
    cin >> a >> b;
    if (a == 0 && b == 0)
      ans++;
    else if (a == 0)
      za++;
    else if (b == 0)
      zb++;
    else
      v.emplace_back(a / b);
  }
  sort(v.begin(), v.end());
  long long res = 1;
  res *= modpow(2, za) + modpow(2, zb) + mod - 1;
  res %= mod;
  n = v.size();
  vb used(n, false);
  int w = 0;
  while (w < n) {
    if (v[w] > 0) break;
    long long sum = 0;
    int i = w;
    while (i < n) {
      if (v[i] == v[w])
        sum++;
      else
        break;
      i++;
    }
    int l = (lower_bound(v.begin(), v.end(), -((long double)(1) / v[w])) -
             v.begin());
    int r = l;
    while (r < n) {
      if (v[r] != -(1 / v[w])) break;
      used[r] = true;
      r++;
    }
    res *= modpow(2, r - l) + modpow(2, sum) + mod - 1;
    res %= mod;
    w = i;
  }
  long long sum = 0;
  for (long long i = w; i < (long long)(n); i++)
    if (!used[i]) sum++;
  res *= modpow(2, sum);
  out((res + ans - 1 + mod) % mod);
}
