#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;
#define int 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;
}

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 ans = 1;
    int n;
    cin >> n;
    vector<tuple<ll,ll,int,int>>z;
    int zerzer=0;
    int azer = 0;
    int bzer = 0;
    int y=0;
    int s=0;
    for (int i = 0; i < n; i++) {
        ll a, b;
        cin >> a >> b;
        if (a == 0 && b == 0) {
            zerzer++;
            continue;
        }
        if (a == 0) {
            azer++;
            continue;
        }
        if (b == 0) {
            bzer++;
            continue;
        }
        if (a == b) {
            y++;
            continue;
        }
        if (a == -1*b) {
            s++;
            continue;
        }
        int tt = 0;
        if ((a < 0 && b>0) || (a > 0 && b < 0)) { 
            tt++; 

        }
        a = abs(a);
        b = abs(b);
        ll t = euclidean_gcd(a, b);
        a /= t;
        b /= t;
        int n = 0;
        if (a < b) {
            n++;
            ll c = a;
            a = b;
            b = c;
        }
            z.push_back(make_tuple(a , b,tt,n));

    }
    sort(z.begin(), z.end());
    z.push_back(make_tuple(-1, -1, -1,-1));
    ll ft = 0;
    ll st = 0;
    ll fn = 0;
    ll sn = 0;
    for (int i = 0; i < z.size()-1; i++) {
        if (get<0>(z.at(i)) == get<0>(z.at(i + 1)) && (get<1>(z.at(i)) == get<1>(z.at(i + 1)))) {
            if(get<2>(z.at(i))  ==   0&& get<3>(z.at(i)) == 0)ft++;
            if (get<2>(z.at(i)) == 1&& get<3>(z.at(i)) == 0)st++;
            if (get<2>(z.at(i)) == 0 && get<3>(z.at(i)) == 1)fn++;
            if (get<2>(z.at(i)) == 1 && get<3>(z.at(i)) == 1)sn++;
        }
        else {
            if (get<2>(z.at(i)) == 0 && get<3>(z.at(i)) == 0)ft++;
            if (get<2>(z.at(i)) == 1 && get<3>(z.at(i)) == 0)st++;
            if (get<2>(z.at(i)) == 0 && get<3>(z.at(i)) == 1)fn++;
            if (get<2>(z.at(i)) == 1 && get<3>(z.at(i)) == 1)sn++;


            ans *= ((modpow(2,ft,1000000007) + modpow(2, sn, 1000000007)-1)%1000000007);
            ans %= 1000000007;
            ans *= ((modpow(2, st, 1000000007) + modpow(2, fn, 1000000007)-1) % 1000000007);
            ans %= 1000000007;

            ft = 0;
            st = 0;
            fn = 0;
            sn = 0;
        }
    }
    ans *= ((modpow(2, azer, 1000000007) + modpow(2, bzer, 1000000007)-1) % 1000000007);
    ans %= 1000000007;
    ans *= ((modpow(2, y, 1000000007) + modpow(2, s, 1000000007) - 1) % 1000000007);
    ans %= 1000000007;
    ans += zerzer;
    ans += 1000000006;
    ans %= 1000000007;
    cout << ans << endl;
}