#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;
typedef pair<long long int, pll> lpll;


const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323; 

long long int N,K,A[202000],B[200200],H,M;

vector<long long int>Edge[200200];
string S;
queue<long long int>que;
long long int res=1;



map<pll,long long int>mp;
map<pll,bool>used;
//累乗(繰り返し2乗法)　aのb乗(mod)を求める。
class Ruizyou{
    public:
    long long int rui(long long int a, long long int b, long long mod) {
        int memo[65] = {};
        long long int A[65] = {};
        long long int tmp = 1;
        for (int i = 0; i < 65; i++) {
            memo[i] = b % 2;
            b /= 2;
        }

        A[0] = a;
        A[0] %= mod;

        for (int i = 1; i < 65; i++) {
            A[i] = A[i - 1] * A[i - 1];
            A[i] %= mod;
        }
        for (int i = 0; i < 65; i++) {
            if (memo[i] == 1) {
                tmp *= A[i];
                tmp %= mod;
            }
        }
        tmp %= mod;
        return tmp;
    }
};
int main(){
    cout << fixed << setprecision(18);
    cin>>N;
    //Union_Find UF(N);
    Ruizyou Rui;
    for(long long int i = 0; i < N; i++){
        cin>>A[i]>>B[i];
        if(A[i]<0){
            A[i]=-A[i];
            B[i]=-B[i];
        }

        if(A[i]!=0&&B[i]!=0){
            long long int g=gcd(abs(A[i]),abs(B[i]));
            A[i]/=g;
            B[i]/=g;
            if(mp.find({A[i],B[i]})==mp.end()){mp[{A[i],B[i]}]=1;}
            else{mp[{A[i],B[i]}]++;}
        }else if(A[i]==0&&B[i]==0){
            if(mp.find({A[i],B[i]})==mp.end()){mp[{A[i],B[i]}]=1;}
            else{mp[{A[i],B[i]}]++;}
        }else if(A[i]==0){
            if(mp.find({0,1})==mp.end()){mp[{0,1}]=1;}
            else{mp[{0,1}]++;}
        }else{
            if(mp.find({1,0})==mp.end()){mp[{1,0}]=1;}
            else{mp[{1,0}]++;}
        }
        //cout<<A[i]<<" "<<B[i]<<endl;
    }
    long long int tmp=0;
    if(mp.find({0,1})!=mp.end()){tmp+=Rui.rui(2,mp[{0,1}],mod);}
    if(mp.find({1,0})!=mp.end()){tmp+=Rui.rui(2,mp[{0,1}],mod);}
    if(mp.find({0,1})!=mp.end()&&mp.find({1,0})!=mp.end())tmp--;
    
    res*=max(1LL,tmp);
    res%=mod;
    if(mp.find({1,0})!=mp.end()){res*=Rui.rui(2,mp[{0,0}],mod);}
    res%=mod;
    used[{1,0}]=true;
    used[{0,1}]=true;
    used[{0,0}]=true;
    for(long long int i = 0; i < N; i++){
        if(used.find({A[i],B[i]})!=used.end()){continue;}
        used[{A[i],B[i]}]=true;
        tmp=Rui.rui(2,mp[{A[i],B[i]}],mod);
        //cout<<i<<" "<<tmp<<endl;
        if(B[i]<0){
            if(mp.find({-B[i],A[i]})!=mp.end()){
                tmp+=Rui.rui(2,mp[{-B[i],A[i]}],mod);
                used[{-B[i],A[i]}]=true;
                tmp--;
                res*=tmp;
                res%=mod;
            }else{
                res*=tmp;
                res%=mod;
            }
        }else{
            if(mp.find({B[i],-A[i]})!=mp.end()){
                tmp+=Rui.rui(2,mp[{B[i],-A[i]}],mod);
                used[{B[i],-A[i]}]=true;
                tmp--;
                res*=tmp;
                res%=mod;
            }else{
                res*=tmp;
                res%=mod;
            }
        }
        //cout<<i<<" "<<res<<endl;
    }
    cout<<(res-1+mod)%mod<<endl;
}


