#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = false;
}  // namespace mydef
using namespace mydef;
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans
template <uint MD>
struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(_v % MD + MD); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(ull(v) * r.v % MD); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1)
                r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
    friend istream& operator>>(istream& is, M& r) { return is >> r.v; }
};
using Mint = ModInt<MOD>;
const int MN = 1'000'000;
Mint fact[MN], iFac[MN];

void first() {
    fact[0] = Mint(1);
    for (int i = 1; i < MN; i++)
        fact[i] = fact[i - 1] * Mint(i);
    iFac[MN - 1] = fact[MN - 1].inv();
    for (int i = MN - 1; i >= 1; i--) {
        iFac[i - 1] = iFac[i] * Mint(i);
    }
    assert(fact[2345] * iFac[2345] == Mint(1));
}
Mint C(int n, int k) {
    if (n < k || k < 0)
        return Mint(0);
    return fact[n] * iFac[k] * iFac[n - k];
}
int N, A[202020], B[202020];
vector<pair<int, int>> V1, V2;
int N1, N2, N3, cnt;

void solve() {
    first();
    map<pi, int> m1, m2;
    set<pi> S;
    for (auto& p : V1) {
        m1[p]++;
        S.insert(p);
    }
    for (auto& p : V2) {
        m2[p]++;
        S.insert(p);
    }

    Mint ans = 1;
    for (auto& p : S) {
        ans *= Mint{2}.pow(m1[p]) + Mint{2}.pow(m2[p]) - 1;
    }
    ans *= Mint{2}.pow(N1) + Mint{2}.pow(N2) - 1;
    ans -= 1;

    ans += N3;
    cout << ans << endl;
    /*
    sort(all(V1), [](const pi x, const pi y) {
        return x.first * y.second < y.first * x.second;
    });
    sort(all(V2), [](const pi x, const pi y) {
        return x.first * y.second > y.first * x.second;
    });

    for (auto& p : V1) {
        pi q{p.second, q.first};
        auto it1 = lower_bound(all(V2), q, [](const pi x, const pi y) {
            return x.first * y.second > y.first * x.second;
        });
        auto it2 = lower_bound(all(V2), q, [](const pi x, const pi y) {
            return x.first * y.second > y.first * x.second;
        });
        num += 
    }
    */
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N;
    FOR (N) {
        cin >> A[i] >> B[i];
        if (A[i] == 0 && B[i] == 0) {
            N3++;
        } else if (A[i] == 0) {
            N1++;
        } else if (B[i] == 0) {
            N2++;
        } else {
            int tmp = gcd(abs(A[i]), abs(B[i]));
            A[i] /= tmp;
            B[i] /= tmp;
            if (A[i] < 0) {
                A[i] *= -1;
                B[i] *= -1;
            }
            if (B[i] > 0)
                V1.push_back({A[i], B[i]});
            else
                V2.push_back({-B[i], A[i]});
        }
    }


    solve();
    return 0;
}


Measured memory_bytes: 54768