/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }

/* #endregion */

/* #region mint */

// 自動で MOD を取る整数
struct mint {
    ll x;
    mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
    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;
    }
    // O(log(t))
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1); // ⌊t/2⌋ 乗
        a *= a;               // ⌊t/2⌋*2 乗
        if (t & 1)            // ⌊t/2⌋*2 == t-1 のとき
            a *= *this;       // ⌊t/2⌋*2+1 乗 => t 乗
        return a;
    }

    // for prime mod
    mint inv() const {
        return pow(MOD - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)
    }
    mint &operator/=(const mint a) { return (*this) *= a.inv(); }
    mint operator/(const mint a) const {
        mint res(*this);
        return res /= a;
    }
    bool operator==(const mint a) const { return this->x == a.x; }
    bool operator==(const ll a) const { return this->x == a; }

    // mint 入力
    friend istream &operator>>(istream &is, mint &x) {
        is >> x.x;
        return is;
    }

    // mint 出力
    friend ostream &operator<<(ostream &os, mint x) {
        os << x.x;
        return os;
    }
};

/* #endregion */

/* #region Rational */

// 分母は常に正になるようにしておく
class RationalNum {
  private:
    // 分子
    ll numerator;
    // 分母
    ll denominator;
    // 自身を簡約する
    void simplify() { RationalNum::simplifyNums(numerator, denominator); }

    friend RationalNum operator+(const RationalNum &left, const RationalNum &right);
    friend RationalNum operator-(const RationalNum &left, const RationalNum &right);
    friend RationalNum operator*(const RationalNum &left, const RationalNum &right);
    friend RationalNum operator/(const RationalNum &left, const RationalNum &right);
    friend bool operator==(const RationalNum &left, const RationalNum &right);
    friend bool operator!=(const RationalNum &left, const RationalNum &right);
    friend bool operator<(const RationalNum &left, const RationalNum &right);
    friend bool operator>(const RationalNum &left, const RationalNum &right);
    friend bool operator<=(const RationalNum &left, const RationalNum &right);
    friend bool operator>=(const RationalNum &left, const RationalNum &right);
    friend ostream &operator<<(ostream &out, const RationalNum &obj);
    friend istream &operator>>(istream &in, RationalNum &obj);

  public:
    RationalNum() { numerator = 0, denominator = 1; }
    // RationalNum(double x);
    RationalNum(ll numerator_, ll denominator_ = 1) {
        numerator = numerator_, denominator = denominator_;
        simplify();
    }

    // RationalNum &operator=(const RationalNum &obj);
    RationalNum &operator+=(const RationalNum &obj);
    RationalNum &operator-=(const RationalNum &obj);
    RationalNum &operator*=(const RationalNum &obj);
    RationalNum &operator/=(const RationalNum &obj);
    RationalNum &operator++();
    RationalNum operator++(int);
    RationalNum &operator--();
    RationalNum operator--(int);
    RationalNum operator+() const;
    RationalNum operator-() const;

    // 分子を設定する
    void setNumerator(ll numerator_) { numerator = numerator_; }
    // 分子を返す
    ll getNumerator() const { return numerator; }
    // 分母を設定する
    void setDenominator(ll denominator_) { denominator = denominator_; }
    // 分母を返す
    ll getDenominator() const { return denominator; }

    static void simplifyNums(ll &numerator_, ll &denominator_) {
        if (denominator_ == 0) { // 分母が 0 のときの正規化
            if (numerator_ > 0)
                numerator_ = 1; // 無限大
            else if (numerator_ < 0)
                numerator_ = -1; // 無限小
            else
                numerator_ = 0; // 不定
        } else {
            ll g = gcd(numerator_, denominator_);
            numerator_ /= g, denominator_ /= g;
            if (denominator_ < 0) numerator_ *= -1, denominator_ *= -1;
        }
    }

    RationalNum inv() const { return RationalNum(denominator, numerator); }
    ll ceil() const {
        if (numerator >= 0)
            return (numerator + denominator - 1) / denominator;
        else
            return numerator / denominator;
    }
    ll floor() const {
        if (numerator >= 0)
            return numerator / denominator;
        else
            return (numerator - denominator + 1) / denominator;
    }
};

/* #region RationalFriendFunctions */

RationalNum operator+(const RationalNum &left, const RationalNum &right) {
    if (left.getDenominator() == 0 && right.getDenominator() == 0) {
        if ((left > 0 && right > 0) || (left < 0 && right < 0)) {
            return left; // 無限大・無限小
        } else {
            return RationalNum(0, 0); // 不定
        }
    } else if (left.getDenominator() == 0) {
        return left;
    } else if (right.getDenominator() == 0) {
        return right;
    }
    RationalNum temp;
    ll tempLD = left.getDenominator();
    ll tempRD = right.getDenominator();
    RationalNum::simplifyNums(tempLD, tempRD);
    temp.setDenominator(left.getDenominator() * tempRD);
    temp.setNumerator(left.getNumerator() * tempRD + right.getNumerator() * tempLD);
    temp.simplify();
    return temp;
}

RationalNum operator-(const RationalNum &left, const RationalNum &right) { return left + (-right); }

RationalNum operator*(const RationalNum &left, const RationalNum &right) {
    ll a = left.denominator, b = right.numerator, c = right.denominator, d = left.numerator;
    RationalNum::simplifyNums(b, a), RationalNum::simplifyNums(d, c);
    return RationalNum(b * d, a * c);
}

RationalNum operator/(const RationalNum &left, const RationalNum &right) { return left * right.inv(); }

bool operator==(const RationalNum &left, const RationalNum &right) {
    return (left.numerator == right.numerator && left.denominator == right.denominator);
}

bool operator!=(const RationalNum &left, const RationalNum &right) { return !(left == right); }

// bool operator<(const RationalNum &left, const RationalNum &right) {
//     ll lside = left.getNumerator() * right.getDenominator();
//     ll rside = left.getDenominator() * right.getNumerator();
//     return (lside < rside);
// }
// 積が ll を超えることもあるので，map のキーで使うとかのときは，
// 異なる RationalNum の間に必ず大小関係が定義できるこちらを使う
bool operator<(const RationalNum &left, const RationalNum &right) {
    return left.numerator == right.numerator ? left.denominator < right.denominator : left.numerator < right.numerator;
}

bool operator>(const RationalNum &left, const RationalNum &right) {
    // ll lside = left.getNumerator() * right.getDenominator();
    // ll rside = left.getDenominator() * right.getNumerator();
    // return (lside > rside);
    return !(left < right) && (left != right);
}

bool operator<=(const RationalNum &left, const RationalNum &right) { return ((left < right) || (left == right)); }

bool operator>=(const RationalNum &left, const RationalNum &right) { return ((left > right) || (left == right)); }

// 出力
ostream &operator<<(ostream &out, const RationalNum &obj) {
    if (obj.denominator == 0) {
        if (obj.numerator > 0)
            out << "inf";
        else if (obj.numerator < 0)
            out << "-inf";
        else
            out << "indeterminate";
    } else {
        out << obj.numerator;
        if (obj.numerator != 0 && obj.denominator != 1) out << "/" << obj.denominator;
    }
    return out;
}

/* #endregion */

/* #region RationalMemberFunctions */

// RationalNum &RationalNum::operator=(const RationalNum &obj) {
//     setNumerator(obj.getNumerator()), setDenominator(obj.getDenominator());
//     return *this;
// }

RationalNum &RationalNum::operator+=(const RationalNum &obj) { return *this = *this + obj; }
RationalNum &RationalNum::operator-=(const RationalNum &obj) { return *this = *this - obj; }
RationalNum &RationalNum::operator*=(const RationalNum &obj) { return *this = *this * obj; }
RationalNum &RationalNum::operator/=(const RationalNum &obj) { return *this = *this / obj; }
RationalNum &RationalNum::operator++() { return *this = *this + 1; }

RationalNum RationalNum::operator++(int) {
    RationalNum before = *this;
    *this = *this + 1;
    return before;
}

RationalNum &RationalNum::operator--() { return *this = *this - 1; }

RationalNum RationalNum::operator--(int) {
    RationalNum before = *this;
    *this = *this - 1;
    return before;
}

RationalNum RationalNum::operator+() const { return *this; }

RationalNum RationalNum::operator-() const { return RationalNum(-numerator, denominator); }

/* #endregion */
/* #endregion */

// Problem
void solve() {
    ll n;
    cin >> n;
    vll a(n), b(n);
    REP(i, 0, n) cin >> a[i] >> b[i];

    map<RationalNum, ll> used;
    ll zero = 0;
    ll az = 0, bz = 0;
    REP(i, 0, n) {
        if (a[i] == 0 && b[i] == 0) {
            zero++;
            continue;
        }
        // if (a[i] == 0) {
        //     az++;
        //     continue;
        // }
        // if (b[i] == 0) {
        //     bz++;
        //     continue;
        // }
        // if (b[i] == 0) a[i] = 1;
        // if (a[i] == 0) b[i] = 1;
        RationalNum key(a[i], b[i]);
        if (key == RationalNum(0, 0)) {
            dump(a[i], b[i]);
        }
        if (b[i] == 0) key.setNumerator(1);
        used[key]++;
        RationalNum inv = -(key.inv());
        if (inv.getDenominator() == 0) inv.setNumerator(1);
        used[inv] += 0;
        // if (used[RationalNum(0, 0)] > 0) {
        //     dump(a[i], b[i], key, inv, used[RationalNum(0, 0)], key == RationalNum(0, 0), inv == RationalNum(0, 0));
        //     dump(key<RationalNum(0, 0), key> RationalNum(0, 0), inv<RationalNum(0, 0), inv> RationalNum(0, 0));
        //     exit(0);
        // }
    }

    // dump(used[RationalNum(0, 0)], zero);
    // dump(used[RationalNum(1, 0)]);
    // dump(used[RationalNum(-1, 0)]);
    // dump(used[RationalNum(0, 1)]);

    mint ret = 1;
    // ret *= mint(2).pow(az) + mint(2).pow(bz) - 1;
    // dump(used);
    for (auto [key, _cnt] : used) {
        RationalNum inv = -(key.inv());
        if (inv.getDenominator() == 0) inv.setNumerator(1);
        // if (inv < key) continue;
        // 両方からは選べない
        ret *= mint(2).pow(used[key]) + mint(2).pow(used[inv]) - 1;
        used[key] = 0, used[inv] = 0;
    }
    cout << (ret + zero - 1) << endl;
}

// entry point
int main() {
    solve();
    return 0;
}


Measured memory_bytes: 31404