#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(11);
  int T;
  T = 1;
  while (T--) solve();
}

void solve() {
  int n;
  cin >> n;

  map<pll, int> mp;
  int zz = 0, z_ = 0, _z = 0;

  rep(i, n) {
    ll a_, b_;
    cin >> a_ >> b_;

    if (a_ == 0 && b_ == 0) { zz++; continue; }
    else if (a_ == 0) { z_++; continue; }
    else if (b_ == 0) { _z++; continue; }

    ll g = gcd(a_, b_);

    // どっちかが負なら, a_ が負に
    // map で同一視できるように
    if (a_ < 0 && b_ < 0) {
      a_ = -a_;
      b_ = -b_;
    } else if (a_ >= 0 && b_ >= 0){

    } else {
      if (b_ < 0) {
        b_ = -b_;
        a_ = -a_;
      }
    }

    if (g < 0) g = -g;
    a_ /= g;
    b_ /= g;
    mp[pll(a_, b_)]++;
  }

  ll ans = zz; // 単独
  ll tmp = (modpow(2, z_, mod) - 1 + modpow(2, _z, mod) - 1 + 1 + mod) % mod;
  // cout << tmp << endl;

  for (auto e : mp) {
    pll e2 = pll(-e.F.S, e.F.F);

    if (e2.F < 0 && e2.S < 0) {
      e2.F = -e2.F;
      e2.S = -e2.S;
    } else if (e2.S < 0) {
      e2.F = -e2.F;
      e2.S = -e2.S;
    }
    // cout << e.F << " " << e2 << endl;

    if (!mp.count(e2)) {
      (tmp *= modpow(2, e.S, mod)) %= mod;
      // cout << "0_ " << tmp << endl;
    } else if (e.F == e2) { // (1, 1), (-1, 1)
      (tmp *= e.S + 1) %= mod; // 1 つ選ぶか, 1 つも選ばないか
      // cout << "1_ " << tmp << endl;
    } else {
      (tmp *= modpow(2, e.S, mod) - 1 + modpow(2, mp[e2], mod) - 1 + 1 + mod) %= mod;
      // cout << "2_ " << tmp << endl;
    }
    mp.erase(e2);
  }
  // cout << tmp << endl;
  (tmp = tmp - 1 + mod) %= mod; // すべて選ばない場合
  (ans += tmp) %= mod;
  cout << ans << endl;
}


Measured memory_bytes: 15964