#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>

using namespace std;
using ll = long long;

void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
ll gcd(ll a, ll b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ cout << "[" << p.first << ", " << p.second << "]"; return os; }

#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define Return(expr) { Cout(expr); return 0; }
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)

constexpr int MOD = 1e9+7;
#include <map>

using ll = long long int;
ll modpow(ll N, ll P){
    if(P == 0) return 1;
    if(P % 2 == 0){
        ll t = modpow(N, P/2);
        return t*t % MOD;
    }
    return N * modpow(N, P-1) % MOD;
}

ll sign(ll a){
    return a == 0 ? 0 : a/labs(a);
}

int main(void){
    Cin(int, n);
    Cins2(ll, n, a, b);
    map<pair<ll, pair<ll, ll>>, int> sabn;
    For(i, n){
        ll s = sign(a[i]) * sign(b[i]);
        a[i] = labs(a[i]), b[i] = labs(b[i]);

        ll d = gcd(a[i], b[i]);
        if(d > 1) a[i] /= d, b[i] /= d;
        sabn[{s, {a[i], b[i]}}] ++;
    }
    
    ll ans = 1;
    for(const auto &[sab, n] : sabn){
        const auto &[s, ab] = sab;
        if(s == 0) continue;
        const auto &[a, b] = ab;
        int yada = 0;
        if(sabn.find({-s, {b, a}}) != sabn.end()){
            if(s == -1) continue;
            yada = sabn[{-s, {b, a}}];
        }
        ans = (ans * (modpow(2, n) + modpow(2, yada) + MOD - 1) % MOD) % MOD;
    }
    ans = (ans * (modpow(2, sabn[{0, {1, 0}}]) + modpow(2, sabn[{0, {0, 1}}]) + MOD - 1) % MOD) % MOD;
    Cout((ans + MOD-1 + sabn[{0, {0, 0}}]) % MOD);
}


Measured memory_bytes: 21948