#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >=0; --i)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<ll, ll>;

// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
  ll x; // typedef long long ll;
  mint(ll 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(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  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;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
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];
  }
} c(200005);



int main() {
  ll n;
  cin >> n;

  ll a, b;
  map<pi, ll> m1;
  map<pi, ll> m4;

  ll zero = 0;
  ll xconst = 0;
  ll yconst = 0;
  
  rep(i, n){
    cin >> a >> b;
    if(a==0 && b==0) zero++;
    else if(a==0) xconst++;
    else if(b==0) yconst++;
    else if(a*b>0){
      a = abs(a); b= abs(b);
      ll ab = __gcd(a, b);
      a /= ab; b /= ab;
      pi tmp = make_pair(a, b);
      m1[tmp]++;
    }
    else{
      if(a<0){
	a *= -1;
	b *= -1;
      }
      ll ab = __gcd(a, b*(-1));
      a /= ab; b /= ab;
      pi tmp = make_pair(a, b);
      m4[tmp]++;
    }
  }

  ll single = n - zero - xconst - yconst;
  mint ans = 1;

  for(auto x : m1){
    pi y = x.first;
    pi ppp = make_pair(y.second, y.first*(-1));
    if(m4[ppp]>0) {
      ans *= (mint(2).pow(x.second) + mint(2).pow(m4[ppp]) -1);
      single -= x.second + m4[ppp];
      m4[ppp] = 0;
    }
  }
  cerr << ans.x << endl;

  if(xconst >0 && yconst>0) ans*= (mint(2).pow(xconst) + mint(2).pow(yconst) -1);
  else ans *= mint(2).pow(xconst+yconst);

  cerr << ans.x << endl;

  ans *= mint(2).pow(single);

  cerr << ans.x << endl;

  ans += zero;

  cout << ans.x - 1 << endl;
  return 0;
}
