//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tiii tuple<int, int, int>
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a) / (b) + !!((a) % (b)))

//#define TEST

typedef long long ll;
typedef unsigned long long ull;

using namespace std;
using namespace __gnu_pbds;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream &operator<<(ostream &o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

int main(){
    StarBurstStream

    vector<ll> two(200001);
    two[0] = 1;
    for(int i = 1; i <= 200000; i++) two[i] = two[i - 1] * 2 % MOD;
//    printv(two, cerr);

    int n;
    cin >> n;

    map<pll, pll> cnt;
    ll z = 0;
    for(int i = 0; i < n; i++){
        ll a, b;
        cin >> a >> b;
        if(a == 0 && b == 0){
            z++;
            continue;
        }

        ll g = __gcd(a, b);
        a /= g; b /= g;

        if((a ^ b) < 0){
            pll t = mp(abs(b), abs(a));
            cnt[t].S++;
        }
        else{
            pll t = mp(abs(a), abs(b));
            cnt[t].F++;
        }
    }

    ll ans = 1;
    for(auto it : cnt){
//        cerr << it << "\n";
        ans = ans * (two[it.S.F] + two[it.S.S] - 1) % MOD;
    }

    cout << ((ans - 1 + z) % MOD + MOD) % MOD << "\n";

    return 0;
}