#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;


const int mod = 1000000007;
//const int mod = 998244353;
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;}
//© 2020 GitHub, Inc.


int main() {
    int n;
    cin >> n;
    
    map<pair<ll,ll>,P> mp;
    
    int zero = 0;
    rep(i,n){
        ll x,y;
        cin >> x >> y;
        if(x==0 && y==0){
           zero++;
           continue;
        }
        
        ll g = gcd(x,y);
        x /= g;
        y /= g;
        
        if(y<0){
            x = -x;
            y = -y;
        }
        if (y==0 && x < 0){
            x = -x;
        }
        
        bool rot90 = false;
        if(x<=0){
            rot90 =true;
        }
        
        if(rot90){
            ll tmp = x;
            x=y;
            y= -tmp;
        }
        
        if(rot90){
            mp[{x,y}].first++;  
        }else{
            mp[{x,y}].second++;
        }
        
    }
    
    //ll mod = 1000000007;
    mint ans = 1;
    for(auto p:mp){
        int s = p.second.first;
        int t = p.second.second;
        mint now = 1;
        now += mint(2).pow(2) -1;
        //now = now % mod;
        now += mint(2).pow(2) -1;
        //now = now % mod;
        ans *= now;
        //ans = ans % mod;
    }
    
    ans -= 1;
    ans += zero;
    //ans = ans % mod;
    cout << ans << endl;

}
