#include <bits/stdc++.h>
const int isDebugMode = 1;
using namespace std;
struct edge {
  long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 3000000;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
long long mpow(long long a, long long n, long long mod = MOD) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
void pt() {
  cout << endl;
  return;
}
template <class Head>
void pt(Head&& head) {
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail>
void pt(Head&& head, Tail&&... tail) {
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
void dpt() {
  if (!isDebugMode) return;
  cout << endl;
  return;
}
template <class Head>
void dpt(Head&& head) {
  if (!isDebugMode) return;
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail>
void dpt(Head&& head, Tail&&... tail) {
  if (!isDebugMode) return;
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
template <class T>
void debug(T v) {
  if (!isDebugMode) return;
  for (int i = 0; i < (v.size()); ++i) cout << v[i] << " ";
  cout << endl;
}
template <class T>
void debug2(T v) {
  if (!isDebugMode) return;
  for (int i = 0; i < (v.size()); ++i) {
    for (int j = 0; j < (v[i].size()); ++j) cout << v[i][j] << " ";
    cout << endl;
  }
}
template <class T1, class T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
long long mgcd(T1 a, T2 b) {
  return a % b ? mgcd(b, a % b) : b;
}
template <class T1, class T2>
void reduce(T1& a, T2& b) {
  long long g = mgcd(a, b);
  a /= g;
  b /= g;
  return;
}
bool valid(long long H, long long W, long long h, long long w) {
  return 0 <= h && h < H && 0 <= w && w < W;
}
struct mint {
  long long x;
  mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
  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 {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= 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 {
    mint res(*this);
    return res /= a;
  }
};
class combination {
 public:
  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;
    if (COMBMAX < n) {
      mint ret = 1;
      for (long long i = 1; i <= k; i++) {
        ret *= (n - i + 1);
        ret /= i;
      }
      return ret;
    }
    return fact[n] * ifact[k] * ifact[n - k];
  }
  mint multi(long long n, long long sum, long long l, long long r) {
    long long m = r - l + 1;
    long long t = sum - n * (l - 1);
    mint ans = 0;
    for (long long k = 0; k <= (t - n) / m; k++) {
      long long sign = k % 2 == 0 ? 1 : -1;
      mint temp = this->operator()(n, k);
      temp *= this->operator()(n + (t - n - m * k - 1), t - n - m * k);
      temp *= sign;
      ans += temp;
    }
    return ans;
  }
} com(COMBMAX);
int main() {
  long long N;
  cin >> N;
  vector<long long> a(N), b(N);
  for (int i = 0; i < (N); ++i) cin >> a[i] >> b[i];
  map<pair<bool, pair<long long, long long>>, long long> m;
  set<pair<bool, pair<long long, long long>>> used;
  long long czero = 0, cinf = 0, cminf = 0;
  long long zerozero = 0;
  for (int i = 0; i < (N); ++i) {
    if (a[i] == 0 && b[i] == 0) {
      zerozero++;
      continue;
    }
    if (a[i] == 0) {
      czero++;
    } else if (b[i] == 0) {
      if (a[i] < 0) {
        cminf++;
      } else {
        cinf++;
      }
    } else if ((a[i] < 0 && b[i] < 0) || (a[i] > 0 && b[i] > 0)) {
      reduce(a[i], b[i]);
      m[make_pair(true, pair<long long, long long>(abs(a[i]), abs(b[i])))]++;
    } else {
      reduce(a[i], b[i]);
      m[make_pair(false, pair<long long, long long>(abs(a[i]), abs(b[i])))]++;
    }
  }
  mint ans = 0;
  ans += mpow(2, czero);
  ans *= mpow(2, cinf + cminf);
  for (auto e : m) {
    if (used.count(e.first)) continue;
    used.insert(e.first);
    long long u = e.first.second.second;
    long long d = e.first.second.first;
    used.insert(make_pair(!e.first.first, pair<long long, long long>(u, d)));
    ans *=
        mpow(2, e.second) +
        mpow(2,
             m[make_pair(!e.first.first, pair<long long, long long>(u, d))]) +
        MOD - 1;
  }
  ans += zerozero;
  ans -= 1;
  pt(ans.x);
}
