///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define PI  (3.1415926535)

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}

template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(auto &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

void _debug_print(auto x)
{
    cout << x << endl;
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    printf("-- %s %02d:%02d:%02d.%06ld\n",
           prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}




ll gcm(ll x, ll y)
{
    while (y != 0) {
        ll z = x % y;
        x = y;
        y = z;
    }
    return x;
}



#define MOD   (1000000007LL)
// #define MOD   (998244353LL)

ll mod_mlt(ll x, ll y, ll mod)
{
    ll ret = 0LL;
    x %= mod;

    while (y) {
        if (y & 1LL) {
            ret += x;
            ret %= mod;
        }
        y >>= 1;
        x <<= 1;
        x %= mod;
    }

    return ret;
}

// O(log(exp))
ll mod_pow(ll base, ll exp, ll mod)
{
    ll ret = 1LL;

    for ( ; exp; ) {
        if (exp & 1LL) {
            ret *= base;
            ret %= mod;
        }
        base = (base * base) % mod;
        exp >>= 1;
    }

    return ret;
}

// O(log(mod))
ll mod_inv(ll x, ll mod)
{
    // available only when mod is prime
    return mod_pow(x, mod - 2LL, mod);
}

ull mod_combination(ll x, ll y, ll mod)
{
    if (y > x / 2LL) y = x - y;

    ll ret = 1;

    for (ll i = 0LL; i < y; ++i) {
        ret = (ret * x--) % mod;
        ret = (ret * mod_inv(i + 1LL, mod)) % mod;
    }

    return ret;
}

void make_perms(ll perms[], ll perm_invs[], ll size, ll mod)
{
    perms[0] = 1LL;
    srep (i, 1, size) {
        perms[i] = perms[i-1] * i;
        perms[i] %= mod;
    }

    rep (i, size) {
        perm_invs[i] = mod_inv(perms[i], mod);
    }
}



///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

void f_update(set<t4> &cnt, ll f, ll a, ll b)
{
    ll g = gcm(a, b);
    a /= g;
    b /= g;
    auto iter = cnt.lower_bound(t4(f, a, b, -1e18));

    if (iter == cnt.end()) {
        cnt.insert(t4(f, a, b, 1LL));
        return;
    }

    ll xf = get<0>(*iter);
    ll xa = get<1>(*iter);
    ll xb = get<2>(*iter);
    ll c = get<3>(*iter);
    if (xf == f && xa == a && xb == b) {
        cnt.erase(iter);
        cnt.insert(t4(f, a, b, c+1LL));
    }
    else {
        cnt.insert(t4(f, a, b, 1LL));
    }
}

void _main()
{
    ll n; llin(n);
    S V<t2> ablist; llinl2(ablist, n);

    ll allzero = 0;
    ll zero1 = 0;
    ll zero2 = 0;
    ll eq1 = 0;
    ll eq2 = 0;
    S set<t4> cnt1;
    S set<t4> cnt2;

    for (auto ab : ablist) {
        ll a = get<0>(ab);
        ll b = get<1>(ab);
        if (a == 0 && b == 0) { allzero++; continue; }
        if (a == 0) { zero1++; continue; }
        if (b == 0) { zero2++; continue; }

        bool positive = false;
        if (a > 0 && b > 0) positive = true;
        if (a < 0 && b < 0) positive = true;

        if (positive) {
            if (abs(a) == abs(b)) { eq1++; continue; }
            if (abs(a) < abs(b)) f_update(cnt1, 1, abs(a), abs(b));
            if (abs(a) > abs(b)) f_update(cnt2, -1, abs(b), abs(a));
        }
        else {
            if (abs(a) == abs(b)) { eq2++; continue; }
            if (abs(a) < abs(b)) f_update(cnt1, -1, abs(a), abs(b));
            if (abs(a) > abs(b)) f_update(cnt2, 1, abs(b), abs(a));
        }
    }

    S set<t3> keys;
    for (auto c : cnt1) {
        ll f = get<0>(c);
        ll a = get<1>(c);
        ll b = get<2>(c);
        keys.insert(t3(f, a, b));
    }
    for (auto c : cnt2) {
        ll f = get<0>(c);
        ll a = get<1>(c);
        ll b = get<2>(c);
        keys.insert(t3(f, a, b));
    }

    debug_printf("---- zero1=%lld zero2=%lld eq1=%lld eq2=%lld\n",
                 zero1, zero2, eq1, eq2);

    debug_printf("---- cnt1\n");
    debug_print(cnt1);
    debug_printf("---- cnt2\n");
    debug_print(cnt2);
    debug_printf("---- keys\n");
    debug_print(keys);

    S ll pows[200005];
    pows[0] = 1LL;
    srep (i, 1, 200005) {
        pows[i] = pows[i-1] * 2LL;
        pows[i] %= MOD;
    }

    ll ans = 1LL;

    ll mlt = pows[zero1] + pows[zero2];
    mlt %= MOD;
    mlt--;
    if (mlt < 0LL) mlt += MOD;
    ans *= mlt;
    ans %= MOD;

    mlt = pows[eq1] + pows[eq2];
    mlt %= MOD;
    mlt--;
    if (mlt < 0LL) mlt += MOD;
    ans *= mlt;
    ans %= MOD;

    debug_printf("---- ans1=%lld\n", ans);

    for (auto key : keys) {
        ll f = get<0>(key);
        ll a = get<1>(key);
        ll b = get<2>(key);

        ll c1 = 0;
        ll c2 = 0;

        auto iter1 = cnt1.lower_bound(t4(f, a, b, -1e18));
        if (iter1 != cnt1.end()) {
            ll xf = get<0>(*iter1);
            ll xa = get<1>(*iter1);
            ll xb = get<2>(*iter1);
            ll c = get<3>(*iter1);
            if (xf == f && xa == a && xb == b) c1 = c;
        }

        auto iter2 = cnt2.lower_bound(t4(f, a, b, -1e18));
        if (iter2 != cnt2.end()) {
            ll xf = get<0>(*iter2);
            ll xa = get<1>(*iter2);
            ll xb = get<2>(*iter2);
            ll c = get<3>(*iter2);
            if (xf == f && xa == a && xb == b) c2 = c;
        }

        ll mlt = pows[c1] + pows[c2];
        mlt %= MOD;
        mlt--;
        debug_printf("----------- mlt=%lld\n", mlt);
        if (mlt < 0LL) mlt += MOD;
        ans *= mlt;
        ans %= MOD;
    }

    ans--;
    if(ans < 0) ans += MOD;
    ans += allzero;
    ans %= MOD;

    debug_printf("---- ans\n");
    cout << ans << endl;
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 35952