#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll n;
    cin >> n;
    ll ans = 1;
    vector<pair<ll,ll>> z;
    map<pair<ll, ll>,ll> mp;
    ll bothz = 0;
    ll az = 0;
    ll bz = 0;
    for (ll i = 0; i < n; i++) {
        ll a, b;
        cin >> a >> b;
        if (a == 0 && b == 0) {
            bothz++;
            continue;
        }
        if (a == 0) {
            az++;
            continue;
        }
        if (b == 0) {
            bz++;
            continue;
        }
        ll k = 1;
        if (a < 0) {
            a *= -1;
            k *= -1;
        }
        if (b < 0) {
            b *= -1;
            k *= -1;
        }
        ll d = gcd(a, b);
        a /= d;
        b /= d;
        a *= k;
        z.push_back(make_pair(a, b));
    }
    for (ll i = 0; i < z.size(); i++) {
        if (mp.count(z[i])) {
            mp[z[i]]++;
        }
        else {
            mp[z[i]] = 1;
        }
    }
    for (ll i = 0; i < z.size(); i++) {
        ll h = 1;
        if (z[i].first > 0)h = -1;
        ans *= (modpow(2,mp[make_pair(h*z[i].second, abs(z[i].first))], 1000000007)+ modpow(2,mp[make_pair(z[i].first, z[i].second)], 1000000007)-1)%1000000007;
        mp[make_pair(h * z[i].second, abs(z[i].first))] = 0;
        mp[make_pair(z[i].first, z[i].second)] = 0;
    }
    ans %= 1000000007;
    ans *= (modpow(2, az, 1000000007)+ modpow(2, bz, 1000000007)-1)%1000000007;
    ans %= 1000000007;
    ans += bothz;
    ans %= 1000000007;
    cout << (ans+1000000006) % 1000000007 << endl;
}