#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#ifdef ONLINE_JUDGE
  #define debug(x)
  #define debug2(x,y)
  #define debug3(x,y,z)
  #define assert(e) if(!(e)){stod("");}
#else
  #define debug(x) std::cerr<<#x<<": "<<x<<"\n"
  #define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
  #define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"
#endif

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int mod = 1000000007;

void solve() {
  int n;
  scan(n);
  vll two(n+1, 1);
  rep (i, n) {
    two[i+1] = two[i] * 2 % mod;
  }
  vll a(n), b(n);
  rep (i, n) {
    scan(a[i], b[i]);
  }
  map<vll, ll> mp;
  int corner0 = 0;
  rep (i, n) {
    if (a[i] == 0 && b[i] == 0) {
      corner0 += 1;
      continue;
    }
    ll g = gcd(a[i], b[i]);
    a[i] /= g;
    b[i] /= g;
    if (a[i] < 0) {
      a[i] = -a[i];
      b[i] = -b[i];
    } else if (a[i] == 0) {
      b[i] = max(b[i], -b[i]);
    }
    debug2(a[i], b[i]);
    auto k = vll{a[i], b[i]};
    mp[k] += 1;
  }
  vvll cnt;
  for (auto p : mp) {
    vll k1 = p.first;
    //debug2(p.first, p.second);
    if (k1[1] < 0) {
      continue;
    }
    vll k2 = vll{k1[1], -k1[0]};
    //debug2(k1, k2);
    if (mp.find(k2) == end(mp) || mp[k2] == 0) {
      continue;
    }
    debug(mp[k2]);
    cnt.push_back(vll{p.second, mp[k2]});
  }
  //debug(cnt);
  ll ans = 1;
  ll rest = n - corner0;
  for (vll cn : cnt) {
    ll part = (two[cn[0]] + two[cn[1]] - 1) % mod;
    ans = ans * part % mod;
    rest -= (cn[0] + cn[1]);
  }
  assert (rest >= 0);
  ans = ans * two[rest] % mod;
  ans = (ans + mod - 1 + corner0) % mod;
  print(ans);
}

int main() {
  solve();
  return 0;
}


Measured memory_bytes: 29368