#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
using PLI = pair<long long, int>;
using PLL = pair<long long, long long>;
template<class A, class B> ostream& operator <<(ostream& out, const pair<A, B> &p) {
    return out << "(" << p.first << ", " << p.second << ")";
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const deque<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
template<class T> inline void YES(T condition) { 
    if(condition) cout << "YES" << endl;
    else cout << "NO" << endl;
}
template<class T> inline void Yes(T condition) {
    if(condition) cout << "Yes" << endl;
    else cout << "No" << endl;
}
template<class T> T gcd(T a, T b) {
    while (b) {
        T tmp = b;
        b = a % b;
        a = tmp;
    }
    return a;
}
template<class T> T lcm(T a, T b){
    return a / gcd(a, b) * b;
}

#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

long long qpow(long long a, long long b, int MOD) {
    if (b == 0) return 1;
    long long res = 1;
    while (b) {
        if (b & 1) res = (res * a) % MOD;
        a = (a * a) % MOD;
        b >>= 1;
    }
    return res;
}

const int MOD = 1e9 + 7;
const int maxn = 2e6;
int fac[maxn + 5];
int invfac[maxn + 5];
void init() {
    fac[0] = 1;
    for (int i = 1; i <= maxn; i++) fac[i] = 1LL * fac[i - 1] * i % MOD;
    invfac[maxn] = (int)(qpow(fac[maxn], MOD - 2, MOD));
    for (int i = maxn - 1; i >= 0; i--) invfac[i] = 1LL * invfac[i + 1] * (i + 1) % MOD;
}
int C(int n, int k) {
    assert(0 <= k && n >= k);
    int tmp = (int)(1LL * invfac[k] * invfac[n - k] % MOD);
    return (int)(1LL * fac[n] * tmp % MOD);
}

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

    int n;
    cin >> n;
    vector<LL> a(n);
    vector<LL> b(n);
    map<PLL, vector<int>> revs;
    map<PLL, vector<int>> sames;
    vector<int> seen(n, 0);
    map<int, PLL> key1;
    map<int, PLL> key2;
    vector<int> fi0;
    vector<int> se0;
    vector<int> all0;

    LL ans = 1;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        if (a[i] == 0 && b[i] == 0) {all0.push_back(i); continue;}
        if (a[i] == 0) fi0.push_back(i);
        if (b[i] == 0) se0.push_back(i);
        // -bj / aj
        LL gc = gcd(a[i], -b[i]);
        LL fi = -b[i] / gc;
        LL se = a[i] / gc;
        if (fi < 0) {fi = -fi, se = -se;}
        revs[make_pair(fi, se)].push_back(i);
        key1[i] = make_pair(fi, se);

        gc = gcd(a[i], b[i]);
        fi = a[i] / gc;
        se = b[i] / gc;
        if (fi < 0) {fi = -fi, se = -se;}
        sames[make_pair(fi, se)].push_back(i);
        key2[i] = make_pair(fi, se);
    }

    LL add = 0;
    for(auto& i: all0) {add++; seen[i] = 1;}
    int ccnt1 = fi0.size();
    int ccnt2 = se0.size();
    LL contri = qpow(2, ccnt1, MOD) + qpow(2, ccnt2, MOD);
    contri = ((contri - 1) % MOD + MOD) % MOD;
    ans *= contri;
    ans %= MOD;
    for(auto& i: fi0) seen[i] = 1;
    for(auto& i: se0) seen[i] = 1;
    // trace(revs);
    // trace(key1);
    // trace(sames);
    // trace(key2);

    // vector<int> fa(n);
    // vector<int> sz(n, 1);
    // function<int(int)> getFa = [&](int x) {
    //     return (fa[x] == x) ? x : getFa(fa[x]);
    // };

    // function<bool(int, int)> Union = [&](int x, int y) {
    //     int pax = getFa(x), pay = getFa(y);
    //     if (pax == pay) return false;
    //     if (sz[pax] > sz[pay]) swap(pax, pay);
    //     fa[pax] = pay;
    //     sz[pay] += sz[pax];
    //     return true;
    // };


    // for (int i = 0; i < n; i++) fa[i] = i;
    for (int i = 0; i < n; i++) {
        if (seen[i]) continue;
        PLL ikey2 = key2[i];
        int cnt1 = sames[ikey2].size();
        int cnt2 = revs[ikey2].size();
        LL contri = qpow(2, cnt1, MOD) + qpow(2, cnt2, MOD);
        contri = ((contri - 1) % MOD + MOD) % MOD;
        ans *= contri;
        ans %= MOD;
        for (auto&j: sames[ikey2]) seen[j] = 1;
        for (auto&j: revs[ikey2]) seen[j] = 1;
        // if (seen[i]) continue;
        // seen[i] = 1;
        // // for (auto& j: sames[ikey2]) {Union(i, j); seen[j] = 1;}
        // for (auto& j: revs[ikey2]) {
        //     cout << "diff: ";
        //     trace(i, j);
        //     Union(i, j); seen[j] = 1;}
    }
    // for (int i = 0; i < n; i++) fa[i] = getFa(i);

    // vector<int> used(n, 0);
    // LL ans = 1;
    // for (int i = 0; i < n; i++) {
    //     if (used[fa[i]]) continue;
    //     used[fa[i]] = 1;
    //     ans *= (sz[fa[i]] + 1);
    //     ans %= MOD;
    // }
    // trace(gcd(0, 3));
    ans = ((ans - 1 + add) % MOD + MOD) % MOD;
    cout << ans << '\n';

    

    return 0;
}


Measured memory_bytes: 91640