#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353; // うくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうく

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

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

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

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

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

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

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

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

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

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

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

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

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

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< mod >;

int main() {
  int N;
  cin >> N;
  vector< int64 > A(N), B(N);
  int tate = 0, yoko = 0;
  map< pair< int64, int64 >, int > mp[2][2];
  vector< pair< int64, int64 > > group;
  for(int i = 0; i < N; i++) {
    cin >> A[i] >> B[i];
    if(A[i] == 0 && B[i] == 0) {
      zero++;
    } else if(A[i] == 0) {
      tate++;
    } else if(B[i] == 0) {
      yoko++;
    } else {
      bool x = A[i] > 0;
      bool y = B[i] > 0;
      A[i] = abs(A[i]);
      B[i] = abs(B[i]);
      int64 g = __gcd(A[i], B[i]);
      A[i] /= g;
      B[i] /= g;
      mp[x][y][{A[i], B[i]}]++;
      group.emplace_back(A[i], B[i]);
      group.emplace_back(B[i], A[i]);
    }
  }
  sort(begin(group), end(group));
  group.erase(unique(begin(group), end(group)), end(group));
  modint dp = 1;
  for(auto &tap : group) {
    int sz00 = mp[1][1][{tap.first, tap.second}];
    int sz01 = mp[1][0][{tap.second, tap.first}];
    int sz10 = mp[0][1][{tap.second, tap.first}];
    int sz11 = mp[0][0][{tap.first, tap.second}];
    modint ways = 1;
    ways += modint(2).pow(sz00 + sz11) - 1;
    ways += modint(2).pow(sz10 + sz01) - 1;
    dp *= ways;
  }
  modint ways = 1;
  ways += modint(2).pow(tate) - 1;
  ways += modint(2).pow(yoko) - 1;
  dp *= ways;
  if(zero > 0) dp += 1; // うく2
  cout << dp - 1 << "\n";
}
