#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 3e18;
const ll fact_table = 1200008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←

// インタラクティブ問題の時はこのdefineを外してください
#define endl "\n"
#ifdef ENJAPMA
    #undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
// const ll mod = 998244353ll;
const ll mod = 1000000007ll;
const ll mod2 = 2000000033ll;
const ll mod3 = 2000000063ll;
  
ll mypow(ll number1,ll number2, ll mod){
    if(number2 == 0){
        return 1ll;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
/*

ll fact[fact_table + 5],rfact[fact_table + 5]; 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    assert(n >= r);
    assert(n >= 0);
    assert(r >= 0);
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
bool multicase = false;

ll n,m,num,a,b,c,d,e,q, ans;
ll x[500005], y[500005], z[500005];;

ll cost[500005];
vector<ll> G[500005];
queue<ll> que;
ll zero_num, inf_num;

void solve(){
    map<P, ll> table1, table2;
    cin >> n;
    ll ans = 1;
    ll tmp = 0ll;
    for(ll i=0;i<n;i++){
        cin >> x[i] >> y[i];
        if(x[i] == 0 && y[i] == 0){
            tmp ++;
            continue;
        }
        bool minus = false;
        if(x[i] > 0 && y[i] < 0){
            minus = true;
            y[i] = -y[i];
        }else if(x[i] < 0 && y[i] > 0){
            minus = true;
            x[i] = -x[i];
        }
        ll a;
        bool zero = false;
        if(x[i] == 0){
            zero = true;
            a = mod2 + 1;
        }else if(y[i] == 0){
            zero = true;
            a = 0;
        }else{
            ll tmp1 = x[i] % mod2, tmp2 = y[i] % mod2;
            ll tmp3 = x[i] % mod3, tmp4 = y[i] % mod3;
            a = (tmp2 * mypow(tmp1, mod2 - 2, mod2)) % mod2;
            b = (tmp4 * mypow(tmp3, mod3 - 2, mod3)) % mod3;
        }
        if(zero){
            if(a == 0){
                zero_num ++;
            }else{
                inf_num ++;
            }
        }else if(minus){
            table2[P(a, b)] ++;
        }else{
            table1[P(a, b)] ++;
        }
    }
    /*
    p("table1");
    for(auto v: table1){
        pe(v.first);p(v.second);
    }
    p("table2");
    for(auto v: table2){
        pe(v.first);p(v.second);
    }
    */
    // pe(zero_num);p(inf_num);
    
    ans *= (mypow(2ll, zero_num, mod) + mypow(2ll, inf_num, mod) - 1);
    ans %= mod;
    for(auto v: table1){
        ll value = v.first.first, size1 = v.second;
        ll value2 = v.first.second;
        ll nvalue1 = mypow(value, mod2 - 2, mod2);
        ll nvalue2 = mypow(value2, mod3 - 2, mod3);
        ll size2 = table2[P(nvalue1, nvalue2)];
        ll res = mypow(2ll, size1, mod) + mypow(2ll, size2, mod);
        res %= mod;
        res = res + mod - 1;
        res %= mod;
        ans *= res;
        ans %= mod;
    }
    for(auto v: table2){
        ll value = v.first.first, size1 = v.second;
        ll value2 = v.first.second;
        ll nvalue = mypow(value, mod2 - 2, mod2);
        ll nvalue2 = mypow(value2, mod3 - 2, mod3);
        ll size2 = table1[P(nvalue, nvalue2)];
        if(size2 >= 1)continue;
        ll res = mypow(2ll, size1, mod);
        ans *= res;
        ans %= mod;
    }
    ans = ans + mod - 1;
    ans %= mod;
    ans = ans + tmp;
    ans %= mod;
    p(ans);
    return;
}

int main(){
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if(multicase){
        cin >> q;
    }else{
        q = 1; 
    }
    while(q--){
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}
















Measured memory_bytes: 43368