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

#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;


const int MOD = 1e9+7;
const int MAXR = 510000;

template<ll mod> class modint{
public:
    ll val=0;
    //コンストラクタ
    modint(ll x=0){while(x<0)x+=mod;val=x%mod;}
    //コピーコンストラクタ
    modint(const modint &r){val=r.val;}
    //算術演算子
    modint operator -(){return modint(-val);} //単項
    modint operator +(const modint &r){return modint(*this)+=r;}
    modint operator -(const modint &r){return modint(*this)-=r;}
    modint operator *(const modint &r){return modint(*this)*=r;}
    modint operator /(const modint &r){return modint(*this)/=r;}
    //代入演算子
    modint &operator +=(const modint &r){
        val+=r.val;
        if(val>=mod)val-=mod;
        return *this;
    }
    modint &operator -=(const modint &r){
        if(val<r.val)val+=mod;
        val-=r.val;
        return *this;
    }
    modint &operator *=(const modint &r){
        val=val*r.val%mod;
        return *this;
    }
    modint &operator /=(const modint &r){
        ll a=r.val,b=mod,u=1,v=0;
        while(b){
            ll t=a/b;
            a-=t*b;swap(a,b);
            u-=t*v;swap(u,v);
        }
        val=val*u%mod;
        if(val<0)val+=mod;
        return *this;
    }
    //等価比較演算子
    bool operator ==(const modint& r){return this->val==r.val;}
    bool operator <(const modint& r){return this->val<r.val;}
    bool operator !=(const modint& r){return this->val!=r.val;}
};

using mint = modint<MOD>;

//入出力ストリーム
istream &operator >>(istream &is,mint& x){//xにconst付けない
    ll t;is >> t;
    x=t;
    return (is);
}
ostream &operator <<(ostream &os,const mint& x){
    return os<<x.val;
}

//累乗
mint modpow(const mint &a,ll n){
    if(n==0)return 1;
    mint t=modpow(a,n/2);
    t=t*t;
    if(n&1)t=t*a;
    return t;
}

//二項係数の計算
mint fac[MAXR+1],finv[MAXR+1],inv[MAXR+1];
//テーブルの作成
void com_init() {
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    FOR(i,2,MAXR){
        fac[i]=fac[i-1]*mint(i);
        inv[i]=-inv[MOD%i]*mint(MOD/i);
        finv[i]=finv[i-1]*inv[i];
    }
}
//演算部分
mint com(ll n,ll k){
    if(n<k)return 0;
    if(n<0)return 0;
    if(k==0) return 1;
    return fac[n]*finv[k]*finv[n-k];
}


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

int main() {
    int N; cin >>N;
    map<pair<ll,ll>, int> AB;
    mint zeros = 0;
    REP(i,N){
        ll a,b;
        cin >> a >> b;
        if(a==0 && b==0){//[0,0]は除外（どの点とも組にならないため）
            zeros += 1;
            continue;
        }
        if(a==0 && b!=0){
            a = 0;
            b = 1;
        }else if(a!=0 && b==0){
            a = 1;
            b = 0;
        }else if(a>0){
            ll g = gcd(a,abs(b));
            a = a/g;
            b = b/g;
        }else if(a<0){
            ll g = gcd(abs(a),abs(b));
            a = -a/g;
            b = -b/g;
        }
        AB[make_pair(a,b)]++;
    }

    mint ans = 1;
    map<pair<ll,ll>, int> seen;

    for(auto x: AB){
        if(x.second==0 || seen[x.first]==1){
            continue;
        }
        ll num1 = x.second;
        ll pa = -x.first.second;
        ll pb = x.first.first;

        if (pa==0){
            pb=1;
        }else if(pa<0){
            pa = -pa;
            pb = -pb;
        }

        ll num2 = AB[make_pair(pa, pb)];

        seen[x.first] = 1;
        seen[make_pair(pa, pb)] = 1;
        
        ans *= (modpow(2, num1) + modpow(2,num2) - 1);
        
    }

    ans += zeros;
    ans -= 1;//0匹の場合をのぞく

    cout << ans << endl;
    return 0;
}

Measured memory_bytes: 65540