#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;

#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()

#define pb push_back
#define eb emplace_back
#define Size(c) (int)(c).size()

#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))

template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

template <class T, class S> inline bool chmax(T &a, S b) {
    if(a < b) {a = b;return 1;} return 0;
}
template <class T, class S> inline bool chmin(T &a, S b) {
    if(a > b) {a = b;return 1;} return 0;
}
template <class T>
void line(vector<T> &x){for (auto&& xi : x) cin >> xi;}

inline void IN(void){ return;}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){ cin >> first; IN(rest...); return;}

#define INT(...) int __VA_ARGS__; IN (__VA_ARGS__)
#define LINT(...) lint __VA_ARGS__; IN (__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)

template <class T> void UNIQUE(vector<T> &x) {
    sort(all(x)); x.erase(unique(all(x)), x.end());
}
template <class T> void print_vec(T first, T end){
    for (auto i = first; i < end - 1; i++) cout << *i << " ";
    cout << *(end-1) << endl;
}

template<class... T>
void debug_print(T... args){
    vector<lint> tmp = initializer_list<lint>{args...};
    print_vec(all(tmp));
}
template<class T>
void print(T a){ cout << a << endl;}

vector<string> Yes = {"No", "Yes"};
vector<string> YES = {"NO", "YES"};

int ord(char x){ return (int)(x - 'a');}
char chr(lint x){ return (char)(x + (lint)('a'));}

lint sum(vlint a){lint ret = 0; for(auto&& v:a) ret += v; return ret;}
lint vmini(vlint a, lint &index){
    lint ret = LLONG_MAX;
    rep(i, Size(a)){ if (chmin(ret, a[i])) index = i;}
    return ret;
}
lint vmaxi(vlint a, lint &index){
    lint ret = -LLONG_MAX;
    rep(i, Size(a)){ if (chmax(ret, a[i])) index = i;}
    return ret;
}

lint vmin(vlint a){
    lint ret = LLONG_MAX; for (auto && v : a) chmin(ret, v); return ret;
}
lint vmax(vlint a){
    lint ret = -LLONG_MAX; for (auto && v : a) chmax(ret, v); return ret;
}

vlint Exp(lint n, lint k){
  lint mod = 1e9+7;
  vlint ret(k+1, 1);
  rep(i, k){
    ret[i+1] = ret[i] * n % mod;
  }
  return ret;
}

struct Rational{
  lint numerator, denominator;
  Rational(lint a, lint b){
    if (a == 0 && b == 0) numerator = 0, denominator = 0;
    else if (a == 0) numerator = 0, denominator = 1;
    else if (b == 0) numerator = 1, denominator = 0;
    else{
      lint t = __gcd(a, b);
      a /= t; b /= t;
      if (a < 0) a *= -1, b *= -1;
      numerator = a; denominator = b;
    }
  }
  Rational inverse(){
    return Rational(denominator, numerator);
  }
  Rational orthogonal(){
    return Rational(-denominator, numerator);
  }
};

lint mod = 1e9+7;
// lint mod = 
int main(){
    LINT(n);
    vlint e2 = Exp(2, n);
    lint a, b; lint x = 0;
    map<Rational, lint> fish;
    map<Rational, int> check;
    rep(i, n){
      IN(a, b);
      if (a == 0 && b == 0){
        x ++; x %= mod; continue;
      }
      fish[Rational(a, b)] ++;
    }
    lint ans = 1;
    for (auto [r, cnt] : fish){
      check[r] = 1;
      Rational ort(-r.denominator, r.numerator);
      if (check[ort] == 0){
        ans *= (e2[cnt] - 1 + e2[fish[ort]] - 1 + 1) % mod;
        ans %= mod;
        check[ort] = 1;
      }
    }
    ans += x - 1; ans %= mod;
    if (ans < 0) ans += mod;
    print(ans);
}
