#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MD (1000000007U)
struct Modint{
  unsigned val;
  Modint(){
    val=0;
  }
  Modint(int a){
    val = ord(a);
  }
  Modint(unsigned a){
    val = ord(a);
  }
  Modint(long long a){
    val = ord(a);
  }
  Modint(unsigned long long a){
    val = ord(a);
  }
  inline unsigned ord(unsigned a){
    return a%MD;
  }
  inline unsigned ord(int a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned ord(unsigned long long a){
    return a%MD;
  }
  inline unsigned ord(long long a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned get(){
    return val;
  }
  inline Modint &operator+=(Modint a){
    val += a.val;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator-=(Modint a){
    if(val < a.val){
      val = val + MD - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  inline Modint &operator*=(Modint a){
    val = ((unsigned long long)val*a.val)%MD;
    return *this;
  }
  inline Modint &operator/=(Modint a){
    return *this *= a.inverse();
  }
  inline Modint operator+(Modint a){
    return Modint(*this)+=a;
  }
  inline Modint operator-(Modint a){
    return Modint(*this)-=a;
  }
  inline Modint operator*(Modint a){
    return Modint(*this)*=a;
  }
  inline Modint operator/(Modint a){
    return Modint(*this)/=a;
  }
  inline Modint operator+(int a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(int a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(int a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(int a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator+(long long a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(long long a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(long long a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(long long a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator-(void){
    Modint res;
    if(val){
      res.val=MD-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  inline operator bool(void){
    return val!=0;
  }
  inline operator int(void){
    return get();
  }
  inline operator long long(void){
    return get();
  }
  inline Modint inverse(){
    int a = val;
    int b = MD;
    int u = 1;
    int v = 0;
    int t;
    Modint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += MD;
    }
    res.val = u;
    return res;
  }
  inline Modint pw(unsigned long long b){
    Modint a(*this);
    Modint res;
    res.val = 1;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  inline bool operator==(int a){
    return ord(a)==val;
  }
  inline bool operator!=(int a){
    return ord(a)!=val;
  }
}
;
inline Modint operator+(int a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(int a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(int a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(int a, Modint b){
  return Modint(a)/=b;
}
inline Modint operator+(long long a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(long long a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(long long a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(long long a, Modint b){
  return Modint(a)/=b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class T, class U> inline T GCD_L(T a, U b){
  T r;
  while(b){
    r=a;
    a=b;
    b=r%a;
  }
  return a;
}
template<class S> inline void arrInsert(const int k, int &sz, S a[], const S aval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  a[k] = aval;
}
template<class S, class T> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  a[k] = aval;
  b[k] = bval;
}
template<class S, class T, class U> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
}
template<class S, class T, class U, class V> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval, V d[], const V dval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  for(i=sz-1;i>k;i--){
    d[i] = d[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
  d[k] = dval;
}
int N;
long long X[200000];
long long Y[200000];
Modint two[200000+1];
int main(){
  int i;
  int j;
  int k;
  long long g;
  long long x1;
  long long y1;
  long long x2;
  long long y2;
  map<pair<long long,long long>,int> mp;
  Modint res;
  Modint tmp;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(X[Lj4PdHRW]);
      rd(Y[Lj4PdHRW]);
    }
  }
  two[0] = 1;
  for(i=(0);i<(N);i++){
    two[i+1] = two[i] * 2;
  }
  k = 0;
  for(i=(0);i<(N);i++){
    if(X[i]==0 && Y[i]==0){
      continue;
    }
    arrInsert(k, k, X, X[i], Y, Y[i]);
  }
  res = N - k;
  N = k;
  for(i=(0);i<(N);i++){
    g =GCD_L(X[i], Y[i]);
    {
      auto KrdatlYV = (g);
      X[i] /= KrdatlYV;
      Y[i] /= KrdatlYV;
    }
    if(X[i] < 0){
      {
        auto ao_dF3pO = (-1);
        X[i] *= ao_dF3pO;
        Y[i] *= ao_dF3pO;
      }
    }
    if(X[i]==0 && Y[i] < 0){
      {
        auto tU__gIr_ = (-1);
        X[i] *= tU__gIr_;
        Y[i] *= tU__gIr_;
      }
    }
  }
  for(i=(0);i<(N);i++){
    mp[make_pair(X[i],Y[i])]++;
  }
  tmp = 1;
  for(i=(0);i<(N);i++){
    if(mp[make_pair(X[i],Y[i])] > 0){
      x1 = X[i];
      y1 = Y[i];
      x2 = -y1;
      y2 = x1;
      if(x2 < 0){
        {
          auto YREPHmFM = (-1);
          x2 *= YREPHmFM;
          y2 *= YREPHmFM;
        }
      }
      if(x2==0 && y2 < 0){
        {
          auto jZyWAPpY = (-1);
          x2 *= jZyWAPpY;
          y2 *= jZyWAPpY;
        }
      }
      j = mp[make_pair(x1,y1)];
      mp[make_pair(x1,y1)] = 0;
      k = 0;
      if(mp.count(make_pair(x2,y2))){
        k = mp[make_pair(x2,y2)];
        mp[make_pair(x2,y2)] = 0;
      }
      tmp *= two[j] + two[k] - 1;
    }
  }
  res += tmp;
  res -= 1;
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// int N;
// ll X[2d5], Y[2d5];
// Modint two[2d5+1];
// {
//   int i, j, k;
//   ll g;
//   ll x1, y1, x2, y2;
//   map<pair<ll,ll>,int> mp;
//   Modint res, tmp;
// 
//   rd(N,(X,Y)(N));
// 
//   two[0] = 1;
//   rep(i,N) two[i+1] = two[i] * 2;
// 
//   k = 0;
//   rep(i,N){
//     if(X[i]==0 && Y[i]==0) continue;
//     arrInsert(k, k, X, X[i], Y, Y[i]);
//   }
//   res = N - k;
//   N = k;
// 
//   rep(i,N){
//     g = gcd(X[i],Y[i]);
//     (X[i], Y[i]) /= g;
//     if(X[i] < 0) (X[i], Y[i]) *= -1;
//     if(X[i]==0 && Y[i] < 0) (X[i], Y[i]) *= -1;
//   }
// 
//   rep(i,N) mp[make_pair(X[i],Y[i])]++;
// 
//   tmp = 1;
//   rep(i,N) if(mp[make_pair(X[i],Y[i])] > 0){
//     x1 = X[i];
//     y1 = Y[i];
//     x2 = -y1;
//     y2 = x1;
//     if(x2 < 0) (x2, y2) *= -1;
//     if(x2==0 && y2 < 0) (x2, y2) *= -1;
//     
//     j = mp[make_pair(x1,y1)];
//     mp[make_pair(x1,y1)] = 0;
//     k = 0;
//     if(mp.count(make_pair(x2,y2))){
//       k = mp[make_pair(x2,y2)];
//       mp[make_pair(x2,y2)] = 0;
//     }
// 
//     tmp *= two[j] + two[k] - 1;
//   }
// 
//   res += tmp;
//   res -= 1;
//   wt(res);
// }


Measured memory_bytes: 21004