#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << endl;
}

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;

ll gcd(ll a, ll b) {
    if(b == 0) return a;
    return gcd(b, a%b);
}

struct mint {
    ll x; // typedef long long ll;
    mint(ll x=0):x((x%MOD+MOD)%MOD){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += MOD-a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime MOD
    mint inv() const {
        return pow(MOD-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res/=a;
    }
};

ostream& operator << (ostream& os, const mint a) {
    os << a.x;

    return os;
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    
    int N;
    cin >> N;

    int n_a0 = 0, n_b0 = 0;
    map<pair<ll, ll>, int> m;
    int n0 = 0;

    REP(i, N) {
        ll a, b;
        cin >> a >> b;

        if (a == 0 && b == 0) {
            n0++;
        } else if (a == 0) {
            n_a0++;
        } else if (b == 0) {
            n_b0++;
        } else {
            ll g = gcd(abs(a), abs(b));
            a /= g;
            b /= g;

            if (a * b < 0) {
                m[make_pair(-abs(a), abs(b))]++;
            } else {
                m[make_pair(abs(a), abs(b))]++;
            }
        }
    }

    mint ans = 1;
    map<pair<ll, ll>, bool> used;
    for (auto &e: m) {
        auto p = e.fi;
        int v = e.se;

        if (used[p]) continue;
        used[p] = true;

        ll na = p.se, nb = abs(p.fi);
        if (p.fi > 0) na *= -1;


        auto np = make_pair(na, nb);
        int vn = m[np];
        used[np] = true;

        ans *= mint(2).pow(v) + mint(2).pow(vn) - 1;

    }

    ans *= mint(2).pow(n_a0) + mint(2).pow(n_b0) - 1;

    ans += n0;

    ans -= 1;

    print(ans);
    
}


Measured memory_bytes: 53572