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


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12l
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;
#define M_PI 3.141592653589793238462643383279

li n;
PI ab[200200];

li b[200200];

inline bool ct(map<double, li>& cnt, double x) {
    auto it = cnt.lower_bound(x);
    if (abs(it->F - x) < EPS) {
        return true;
    }
    if (it == cnt.begin()) {
        return false;
    }
    it--;
    if (abs(it->F - x) < EPS) {
        return true;
    }
    return false;
}

int main() {
    cin >> n;
    rin{
        cin >> ab[i].F >> ab[i].S;
        if (ab[i].F == 0) {
            if (ab[i].S != 0)ab[i] = {0, 1};
        } else if (ab[i].S == 0) {
            ab[i] = {1, 0};
        } else{
            li wari = __gcd(abs(ab[i].F), abs(ab[i].S));
            ab[i].F /= wari;
            ab[i].S /= wari;
            if (ab[i].F < 0) {
                ab[i].F *= -1;
                ab[i].S *= -1;
            }
        }
    }
    b[0] = 1;
    repp(i, 1, 200200) {
        b[i] = (b[i - 1] * 2) % MOD;
    }
    map<PI, li> cnt;
    li zero = 0;
    rin{
        if (ab[i].F == 0 && ab[i].S == 0) {
            zero++;
        } else{
            cnt[ab[i]]++;
        }
    }
    li res = 1;
    for (auto && kv :  cnt) {
        if (kv.F.S >= 0 && cnt.count({kv.F.S, -kv.F.F}) > 0) {
            res = res * ((b[kv.S] + b[cnt[ {kv.F.S, -kv.F.F}]] - 1)%MOD) % MOD;
        } else if (kv.F.S <= 0 && cnt.count({ -kv.F.S, kv.F.F})) {
            continue;
        } else {
            res = res * b[kv.S] % MOD;
        }
    }
    //dumpi2(cnt);

    cout << res - 1 + zero << endl;

    return 0;
}