/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 62;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
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;
}

ll conbinationMemo[100][100];

void cmemoInit(){
    rep(i, 100){
        rep(j, 100){
            conbinationMemo[i][j] = -1;
        }
    }
}
 
ll nCr(ll n, ll r){
    if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
//-----------------------ここから----------- 
ll modpow(ll a, ll b){
    ll res = 1;
    while(b > 0){
        if(b & 1){
            res *= a;
            res %= MOD;
        }
        a *= a;
        a %= MOD;
        b >>= 1;
    }
    return res;
}
int main(void){
    ll n;
    cin >> n;
    ll zz = 0;
    ll zw = 0;
    ll wz = 0;

    map<pair<pair<ll,ll>,int>,ll> mp; 
    rep(i, n){
        ll a, b;
        cin >> a >> b;
        if(a == 0 && b == 0){
            zz++;
        } else if(a == 0){
            zw++;
        } else if(b == 0){
            wz++;
        } else {
            int sign = 0;
            if((a > 0 && b > 0) || (a < 0 && b < 0)){
                sign = 1;
            } else {
                sign = 0;
            }
            ll g = gcd(abs(a), abs(b));
            ll aa = abs(a) / g;
            ll bb = abs(b) / g;
            mp[{{aa, bb}, sign}]++;
        }
    }

    map<pair<pair<ll,ll>,int>,int> checked;
    ll ans = 1;
    for(auto &i : mp){
        pair<pair<ll,ll>,int> rev = {{i.first.first.second, i.first.first.first}, !i.first.second};
        if(checked.find(i.first) != checked.end()){
            continue;
        } 
        checked[rev] = 1;
        ll tmp = modpow(2LL, i.second) % MOD;
        tmp += modpow(2LL, mp[rev]);
        tmp %= MOD;
        tmp -= 1;
        while(tmp < 0) tmp += MOD;
        tmp %= MOD;

        ans *= tmp;
        ans %= MOD;
    }

    ll tmp = modpow(2LL, zw);
    tmp %= MOD;
    tmp += modpow(2LL, wz);
    tmp -= 1;
    while(tmp < 0) tmp += MOD;
    tmp %= MOD;

    ans *= tmp;
    ans -= 1;
    ans += zz;
    while(ans < 0) ans += MOD;
    ans %= MOD;

    cout << ans << endl;
}


Measured memory_bytes: 50472