#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1000000007;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll MODPOW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = MODPOW(n, m / 2);
    return (tmp * tmp) % MOD;
  } else {
    return (n * MODPOW(n, m - 1)) % MOD;
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

ll GCD(ll a, ll b) {
  if (b == 0)
    return a;
  return GCD(b, a % b);
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl A(N), B(N);
  map<pll, ll> M;
  ll a_zero = 0;
  ll b_zero = 0;
  ll zero = 0;
  REP(i, N) {
    ll a, b;
    cin >> a >> b;
    if (a == 0 && b == 0) {
      zero++;
      continue;
    }

    if (a == 0) {
      a_zero++;
      continue;
    }
    if (b == 0) {
      b_zero++;
      continue;
    }

    ll gcd = GCD(a, b);
    a /= gcd;
    b /= gcd;
    if (b < 0) {
      a *= -1;
      b *= -1;
    }
    if (M.count({a, b}))
      M[{a, b}]++;
    else
      M[{a, b}] = 1;
  }
  ll ans = 1;

  ll yo = MODPOW(2, a_zero);
  yo += MODPOW(2, b_zero);
  yo = (yo + MOD - 1) % MOD;
  yo %= MOD;
  ans *= yo;
  ans %= MOD;

  ll free = 0;
  map<pll, bool> END;
  AUTO(m, M) {
    // cout << m.first.first << "," << m.first.second << endl;
    if (END.count(m.first))
      continue;
    END[m.first] = true;
    if (M.count({-m.first.second, m.first.first})) {
      // cout << "asa" << m.first.first << "," << m.first.second << endl;
      // cout << M[{-m.first.second, m.first.first}] << endl;
      // cout << m.second << endl;
      ll po = MODPOW(2, m.second);
      po += MODPOW(2, M[{-m.first.second, m.first.first}]);
      po = (po + MOD - 1) % MOD;
      po %= MOD;
      ans *= po;
      ans %= MOD;
      END[{-m.first.second, m.first.first}] = true;
    } else if (M.count({m.first.second, -m.first.first})) {
      // cout << "asa" << m.first.first << "," << m.first.second << endl;
      // cout << M[{-m.first.second, m.first.first}] << endl;
      // cout << m.second << endl;
      ll po = MODPOW(2, m.second);
      po += MODPOW(2, M[{m.first.second, -m.first.first}]);
      po = (po + MOD - 1) % MOD;
      po %= MOD;
      ans *= po;
      ans %= MOD;
      END[{m.first.second, -m.first.first}] = true;
    } else {
      // cout << "b" << m.first.first << "," << m.first.second << endl;
      free += m.second;
    }
  }

  ans *= MODPOW(2, free);
  ans %= MOD;
  ans = (ans - 1 + MOD) % MOD;
  ans = (ans + zero) % MOD;
  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 31336