#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template<typename T> using v1 = vector<T>;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> using v3 = vector<vector<vector<T>>>;
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
const int MOD = 1e9 + 7;
const int INF = numeric_limits<int>::max() - (int)1e8;
const ll INFLL = numeric_limits<ll>::max() - (ll)1e17;

template<int64_t mod>
struct ModInt {
    int64_t value;

    ModInt() : value(0) {}
    ModInt(int64_t x) : value(x >= 0 ? x % mod : (mod - ((-x) % mod) % mod)) {}

    ModInt &operator+=(const ModInt &input) {
        value += input.value;
        if (value >= mod) value -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &input) {
        value += (mod - input.value);
        if (value >= mod) value -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &input) {
        value = value * input.value % mod;
        return *this;
    }

    ModInt &operator/=(const ModInt &input) {
        *this *= input.inverse();
        return *this;
    }

    ModInt inverse() const {
        int64_t base = value, p = mod;
        pair<int64_t, int64_t> save = {1, 0};
        while (p) {
            int64_t temp = base / p;
            swap(base -= temp * p, p);
            swap(save.first -= temp * save.second, save.second);
        }
        return ModInt(save.first);
    }

    ModInt operator-() const { return ModInt(-value); }

    ModInt operator-(const ModInt &input) const { return ModInt(*this) -= input; }

    ModInt operator+(const ModInt &input) const { return ModInt(*this) += input; }

    ModInt operator*(const ModInt &input) const { return ModInt(*this) *= input; }

    ModInt operator/(const ModInt &input) const { return ModInt(*this) /= input; }

    bool operator==(const ModInt &comparison) const { return value == comparison.value; }

    bool operator!=(const ModInt &comparison) const { return value != comparison.value; }

    friend istream &operator>>(istream &stream, ModInt &input) {
        int64_t temp;
        stream >> temp;
        input = ModInt<mod>(temp);
        return stream;
    }

    friend ostream &operator<<(ostream &stream, const ModInt &input) {
        return stream << input.value;
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), x(value);
        while (n > 0) {
            if (n & 1) ret *= x;
            x *= x;
            n >>= 1;
        }
        return ret;
    }

    static const int64_t get_mod() { return mod; }
};

using modint = ModInt<MOD>;

int main() {
    int N;
    cin >> N;
    vector<pl> input;
    map<pl, int> count;
    int zero_count = 0;
    for (int i = 0; i < N; i++) {
        ll A, B;
        cin >> A >> B;
        if (A == 0 && B == 0) {
            zero_count++;
            continue;
        }
        pl ret = {1, 0};
        if (B != 0) {
            ll calc = gcd(abs(A), abs(B));
            ret = {abs(A) / calc, abs(B) / calc};
            if (A < 0) ret.first *= -1;
            if (B < 0) ret.first *= -1;
        }
        input.push_back(ret);
        count[ret]++;
    }
    modint ans = modint(2).pow(input.size()) + zero_count - 1;
    int remain = input.size();
    for (int i = 0; i < input.size(); i++) {
        auto now = input[i];
        count[now]--;
        remain--;
        swap(now.first, now.second);
        now.first *= -1;
        if (now.second < 0) {
            now.first *= -1;
            now.second *= -1;
        }
        if (count[now] == 0) continue;
        int calc = remain - count[now];
        cout << i << " " << calc << endl;
        ans -= modint(2).pow(calc) * (modint(2).pow(count[now]) - 1);
    }
    cout << ans << endl;
}