#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
//increase stack size
#pragma comment(linker, "/STACK:16777216")

ll mxm() {return LLONG_MIN;}
template<typename... Args>
ll mxm(ll a, Args... args) { return max(a,mxm(args...)); }

ll mnm() {return LLONG_MAX;}
template<typename... Args>
ll mnm(ll a, Args... args) { return min(a,mnm(args...)); }

template<class T> ostream& operator<<(ostream& os,vector<T> V){
	os<<"[ ";for(auto v:V)os<<v<<" ";return os<<"]";
}
template<class L,class R> ostream& operator<<(ostream& os,pair<L,R> P){
	return os<<"("<<P.first<<","<<P.second<<")";
}

#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__,__VA_ARGS__)
template<typename Arg1>
void __f(const char* name,Arg1&& arg1){
	cout<<name<<" : "<<arg1<<endl;
}
template <typename Arg1,typename... Args>
void __f(const char* names,Arg1&& arg1,Args&&... args){
	const char* comma=strchr(names+1,',');cout.write(names,comma-names)<<" : "<<arg1<<" | ";__f(comma+1,args...);
}
#else
#define trace(...) 1
#endif

#define ld long double
#define pll pair<ll,ll>
#define ii pair<int,int>
#define vll vector<ll>
#define vii vector<ii>
#define vi vector<int>
#define vpll vector<pll>
#define vld vector<ld>
#define vvld vector<vld>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvpll vector<vpll>
#define vvii vector<vii>
#define I insert
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x)	x.begin(),x.end()

const int mod=1e9+7;
// 128 bit: __int128
inline int add(int a,int b){a+=b;if(a>=mod)a-=mod;return a;}
inline int sub(int a,int b){a-=b;if(a<0)a+=mod;return a;}
inline int mul(int a,int b){return (a*1ll*b)%mod;}
inline int power(int a,int b){int rt=1;while(b>0){if(b&1)rt=mul(rt,a);a=mul(a,a);b>>=1;}return rt;}
inline int inv(int a){return power(a,mod-2);}

struct compare{
	bool operator() (const int &a,const int &b) const{
		return a>b;
	}
};

const ll INF = 2e18;

pll get(ll ai, ll bi){
	ll g = __gcd(ai, bi);
	return {ai / g, bi / g};
}

int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cout<<setprecision(25);
	int n;
	cin >> n;
	vpll v(n);
	map<pll, int> cnts;
	int rem = n;
	int ans = 0;
	int ca = 0, cb = 0;
	map<pll, pll> related;
	map<pll, int> seen;
	pll p1 = {0, 0}, p2 = {INF, INF};
	related[p1] = p2, related[p2] = p1;
	for(int i = 0; i < n; i++){
		cin >> v[i].F >> v[i].S;
		if(v[i].F == 0 && v[i].S == 0){
			ans = add(ans, 1);
			rem--;
			continue;
		}
		if(v[i].F == 0){
			cnts[p1]++;
			continue;
		}
		if(v[i].S == 0){
			cnts[p2]++;
			continue;
		}
		pll pa = get(v[i].F, v[i].S), pb = get(-v[i].S, v[i].F);
		related[pa] = pb, related[pb] = pa;
		cnts[pa]++;
	}
	if(ans == 0) ans = 1;
	for(auto i : cnts){
		if(seen[i.F]) continue;
		int x = i.S;
		pll pb = related[i.F];
		int y = cnts[pb];
		seen[i.F] = seen[pb] = 1;
		int c = power(2, x);
		c = add(c, power(2, y));
		c = sub(c, 1);
		if(c > 0) ans = mul(ans, c);
	}
	ans = sub(ans, 1);
	cout << ans << endl;

}