#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for (int i = 0; i < sz(v); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << " ";
    }
    return os;
}
struct modint {
    ll x;
    modint(ll x = 0) : x((x % MOD + MOD) % MOD) {
    }
    ll value() const {
        return x;
    }
    modint operator-() const {
        return modint(-x);
    }
    modint& operator+=(const modint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    modint& operator-=(const modint a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    modint& operator*=(const modint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    modint operator+(const modint a) const {
        modint res(*this);
        return res += a;
    }
    modint operator-(const modint a) const {
        modint res(*this);
        return res -= a;
    }
    modint operator*(const modint a) const {
        modint res(*this);
        return res *= a;
    }
    modint pow(ll t) const {
        if (t == 0) return 1;
        modint a = pow(t >> 1);
        a *= a;
        if (t % 2 == 1) a *= *this;
        return a;
    }
    modint inv() const {
        return pow(MOD - 2);
    }
    modint& operator/=(const modint a) {
        return (*this) *= a.inv();
    }
    modint operator/(const modint a) const {
        modint res(*this);
        return res /= a;
    }
};
ostream& operator<<(ostream& os, const modint& x) {
    os << x.value();
    return os;
}
int main() {
    int n;
    cin >> n;
    map<pair<ll, ll>, ll> cnt;
    rep(i, n) {
        ll a, b;
        cin >> a >> b;
        if (a == 0 && b == 0) continue;

        if (a == 0)
            cnt[{0, 1}]++;
        else if (b == 0)
            cnt[{1, 0}]++;
        else {
            if (a < 0) a *= -1ll, b *= -1ll;
            ll g = gcd(abs(a), abs(b));
            a /= g;
            b /= g;
            if (b > 0)
                cnt[{a, b}]++;
            else
                cnt[{b, -a}]++;
        }
    }

    modint ans = 1;
    for (auto& [p, num] : cnt) {
        auto [a, b] = p;
        if (a * b == 0) continue;
        if (cnt[{a, b}] == 0) continue;
        modint now = 0;

        now += modint(2).pow(cnt[{a, b}]), cnt[{a, b}] = 0;
        now += modint(2).pow(cnt[{-a, -b}]), cnt[{-a, -b}] = 0;
        now -= 1;
        ans *= now;
    }
    ans *= (modint(2).pow(cnt[{0, 1}]) + modint(2).pow(cnt[{1, 0}]) - 1);
    ans -= 1;
    cout << ans << endl;
}