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

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

template<unsigned mod=1000000007>struct fp {
   unsigned v;
   static unsigned get_mod(){return mod;}
   unsigned inv() const{
      int tmp,a=v,b=mod,x=1,y=0;
      while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
      if(x<0){x+=mod;} return x;
   }
   fp():v(0){}
   fp(ll x):v(x>=0?x%mod:mod+(x%mod)){}
   fp operator-()const{return fp(-v);}
   fp pow(ll t){fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}
   fp& operator+=(const fp& x){if((v+=x.v)>=mod)v-=mod; return *this;}
   fp& operator-=(const fp& x){if((v+=mod-x.v)>=mod)v-=mod; return *this;}
   fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}
   fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}
   fp operator+(const fp& x)const{return fp(*this)+=x;}
   fp operator-(const fp& x)const{return fp(*this)-=x;}
   fp operator*(const fp& x)const{return fp(*this)*=x;}
   fp operator/(const fp& x)const{return fp(*this)/=x;}
   bool operator==(const fp& x)const{return v==x.v;}
   bool operator!=(const fp& x)const{return v!=x.v;}
}; using Fp=fp<>;



int main(){
   int n; cin>>n;
   vector<ll> a(n),b(n);
   map<pair<ll,ll>,int> cnt,exi,used;
   rep(i,0,n){
      cin>>a[i]>>b[i];
      if(a[i]<0)a[i]*=-1,b[i]*=-1;
      if(a[i]==0 and b[i]==0){
         continue;
      }
      ll g=gcd(a[i],b[i]);
      a[i]/=g; b[i]/=g;
      cnt[{a[i],b[i]}]++;
      exi[{a[i],b[i]}]=1;
   }
   Fp res=1;
   for(auto p:cnt)if(used[p.first]==0){
      ll x=p.first.first,y=p.first.second;
      used[{x,y}]=1;
      Fp add=Fp(2).pow(p.second);
      swap(x,y); if(x<0)x*=-1,y*=-1; y*=-1;
      used[{x,y}]=1;
      if(exi.count({x,y}))add+=Fp(2).pow(cnt[{x,y}])-1;
      res*=add;
   } res-=1;
   cout<<res.v<<endl;
   return 0;
}