#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); }
template <class T> inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;

ll mod = 1e9 + 7;
struct mll {  //{{{
    ll x;
    mll(ll x = 0) : x((x % mod + mod) % mod) {}

    // ?= operator
    mll& operator+=(const mll a) {
        (x += a.x) %= mod;
        return *this;
    }
    mll& operator-=(const mll a) {
        (x += mod - a.x) %= mod;
        return *this;
    }
    mll& operator*=(const mll a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mll& operator/=(const mll& rhs) {
        if (rhs.x == 0) throw runtime_error("mll zero division");
        return *this *= rhs.inv();
    }

    mll operator+(const mll a) const {
        mll res(*this);
        return res += a;
    }
    mll operator-(const mll a) const {
        mll res(*this);
        return res -= a;
    }
    mll operator*(const mll a) const {
        mll res(*this);
        return res *= a;
    }
    mll operator/(const mll a) const {
        mll res(*this);
        return res /= a;
    }

    mll pow(ll n) const {
        mll res(1), x(*this);
        if (n < 0) {
            n = -n;
            x = (*this).inv();
        }
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    mll inv() const {
        if (x == 0) throw runtime_error("inv does not exist");
        return pow(mod - 2);
    }
    // mll inv()const{
    //     ll x,y;
    //     ll g=extgcd(v,mod,x,y);
    //     assert(g==1);
    //     if(x<0)x+=mod;
    //     return mll(x);
    // }

    bool operator<(const mll& r) const { return x < r.x; }
    bool operator==(const mll& r) const { return x == r.x; }
};
istream& operator>>(istream& is, const mll& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mll& a) { return os << a.x; }
//}}}
struct combination {  // {{{
    vector<mll> fact, ifact;
    combination(ll n) : fact(n + 1), ifact(n + 1) {
        assert(n < mod);
        fact[0] = 1;
        for (ll i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
        ifact[n] = fact[n].inv();
        for (ll i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
    }
    mll operator()(ll n, ll k) {
        if (k < 0 || k > n) return 0;
        return fact[n] * ifact[k] * ifact[n - k];
    }
}  // }}}
com(500001);

struct Sieve {
    // エラトステネスのふるい O(NloglogN)
    int n;                              // n]
    vector<int> f;                      // [1, 2, 3, 2, 5, 2, 7, 2, 3, ....]
    vector<int> primes;                 // [2, 3, 5, .......]
    Sieve(int n = 1) : n(n), f(n + 1) { /*{{{*/
        f[0] = f[1] = -1;
        for (ll i = 2; i <= n; ++i) {
            if (f[i]) continue;
            primes.push_back(i);
            f[i] = i;
            for (ll j = i * i; j <= n; j += i) {
                if (!f[j]) f[j] = i;
            }
        }
    } /*}}}*/
    bool isPrime(int x) { return f[x] == x; }

    vector<int> factor_list(int x) { /*{{{*/
        vector<int> res;
        if (x < n) {
            while (x != 1) {
                res.push_back(f[x]);
                x /= f[x];
            }
        } else {
            for (int i = 0; primes[i] * primes[i] <= x; i++) {
                while (x % primes[i] == 0) {
                    res.pb(primes[i]);
                    x /= primes[i];
                }
            }
            if (x != 1) res.pb(x);
        }

        return res;  // [2, 3, 3, 5, 5, 5.....]
    }                /*}}}*/

    vector<pair<int, int>> factor(int x) { /*{{{*/
        vector<int> fl = factor_list(x);
        if (fl.size() == 0) return {};
        vector<pair<int, int>> res(1, mp(fl[0], 0));
        for (int p : fl) {
            if (res.back().first == p) {
                res.back().second++;
            } else {
                res.emplace_back(p, 1);
            }
        }
        return res;  // [(2,1), (3,2), (5,3), .....]
    }                /*}}}*/
};

Sieve sv(1e6);
// sv.factor(x);  // 素因数分解

map<pair<ll, ll>, ll> cnt;
ll solve() {
    ll n;cin>>n;
    dump(sv.factor(96));
    
    rep(i, n){
        ll a,b;cin>>a>>b;
        if (a==0 && b==0){
            cnt[mp(0, 0)]++;
        }
        else if (a==0){
            cnt[mp(0, -INF)]++;
        }
        else if (b==0){
            cnt[mp(INF, 0)]++;
        }
        else{
            ll g = gcd((ll)a, (ll)b);
            ll p = a/g;
            ll q = b/g;
            if (p<0){
                p *= -1;
                q *= -1;
            }
            cnt[mp(p, q)]++;
        }
    }
    each(el, cnt){
        dump(el);
    }

    mll ans = 1;
    each(el, cnt){
        cerrendl;
        auto [key, c] = el;
        auto [p, q] = key;
        if (p==0 && q==0){
            ans *= c+1;
            ans *= mll(2).pow(c);
        }
        else{
            ll rp = -q;
            ll rq = p;
            if (rp<0){
                rp *= -1;
                rq *= -1;
            }
            if (rp==0 && rq==INF){
                rq = -INF;
            }
            dump(rp, rq);
            if (cnt.find(mp(rp, rq))!=cnt.end()){
                dump("hello");
                if ((p > 0 && q > 0) || (p==0 && q==-INF)){
                    mll x = mll(2).pow(c)-1;
                    mll y = mll(2).pow(cnt[mp(rp, rq)])-1;
                    dump(x, y);
                    // ans *= mll(2).pow(c-1) + mll(2).pow(cnt[mp(rp, rq)]-1) + 1;
                    ans *= x + y + 1;
                }
            }
            else {
                ans *= mll(2).pow(c);
            }
        }
        dump(ans);
    }
    cout << (ans-1) << endl;

    return 0; 
}


int main(){/*{{{*/
    solve();
    check_input();
    return 0;
}/*}}}*/
