#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

template<int mod>
struct ModInt {
    long long x;
 
    ModInt() : x(0) {}
    ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    explicit operator int() const {return x;}
 
    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;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt power(long long p) const{
        int a = x;
        if (p==0) return 1;
        if (p==1) return ModInt(a);
        if (p%2==1) return (ModInt(a)*ModInt(a)).power(p/2)*ModInt(a);
        else return (ModInt(a)*ModInt(a)).power(p/2);
    }

    ModInt power(const ModInt p) const{
        return ((ModInt)x).power(p.x);
    }

    friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt<mod> &a) {
        long long x;
        is >> x;
        a = ModInt<mod>(x);
        return (is);
    }
};

using modint = ModInt<mod>;



typedef pair<modint,modint> MP;

int n;
map<LP,int> ma;
map<LP,bool> visited;
vector<modint> v={};

ll gcd(ll a,ll b){
  if(a<b) swap(a,b);
  if(b==0) return a;
  return gcd(b,a%b);
}

void solve(){
  cin >> n;
  int num_a=0,num_b=0,all_zero=0;
  rep(i,n){
    ll a,b;cin >> a >> b;
    if(a==0 && b==0){
      all_zero+=1;
      continue;
    }
    if(a==0) {
      num_a+=1;
      continue;
    }
    if(b==0) {
      num_b+=1;
      continue;
    }
    ll g=gcd(abs(a),abs(b));a/=g;b/=g;
    if(b<0) {
      b*=-1; 
      a*=-1;
    }
    //cout << a << " " << b << endl;
    ma[LP(a,b)]+=1;
  }
  for(auto p:ma){
    ll a=p.first.first,b=p.first.second;
    ll c=-b,d=a;if(d<0){
      c*=-1;
      d*=-1;
    }
    //cout << a << "/" << b << " " << -b << "/" << a << endl;
    if(a==0 || b==0) continue;
    if(visited[LP(a,b)] || visited[LP(c,d)]) continue;
    //cout << ma[LP(a,b)] << " " << ma[LP(c,d)] << endl;
    v.push_back(((modint)2).power(ma[LP(a,b)])+((modint)2).power(ma[LP(c,d)])-1);
    visited[LP(a,b)]=true;
    visited[LP(c,d)]=true;
  }
  v.push_back(((modint)2).power(num_a)+((modint)2).power(num_b)-1);
  modint ans=1;
  for(auto t:v){
    //cout << t << endl;
    ans*=t;
  }
  cout << ans-(modint)1+(modint)all_zero << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}

Measured memory_bytes: 54848