#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(int &a, int b) {
	a = min(a, b);
}
void chmax(int &a, int b) {
	a = max(a, b);
}
ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

ll gcd(ll a, ll b) {
	a = abs(a), b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
void normalize(ll &x, ll &y) {
	if (x == 0 && y == 0)return;
	ll g = gcd(x, y);
	x /= g; y /= g;
	if (x < 0) {
		x = -x, y = -y;
	}
	if (x == 0)y = abs(y);
}


modint t2[1 << 18];
void solve() {
	t2[0] = 1;
	rep(i, (1 << 18) - 1) {
		t2[i + 1] = t2[i] * (modint)2;
	}
	int n; cin >> n;
	vector<ll> x(n), y(n);
	rep(i, n) {
		cin >> x[i] >> y[i];
		normalize(x[i], y[i]);
	}
	//rep(i, n)cout << x[i] << " " << y[i] << "\n";
	vector<LP> v;
	int c0 = 0;
	rep(i, n) {
		if (x[i] == 0 && y[i] == 0)c0++;
		else v.push_back({ x[i],y[i] });
	}
	sort(all(v));
	//cout << "?? " << v.size() << "\n";
	modint ans = 1;
	rep(i, v.size()) {
		int memo = i;
		while (i + 1 < v.size() && v[i] == v[i + 1])i++;
		//cout << v[i].first << " " << v[i].second << "\n";
		modint num = i - memo + 1;
		ll cx = v[i].second;
		ll cy = -v[i].first;
		normalize(cx, cy);
		int le = lower_bound(all(v), LP{ cx,cy })-v.begin();
		int ri = upper_bound(all(v), LP{ cx,cy })-v.begin();
		if (le == ri) {
			//cout << v[i].first << " " << v[i].second << " " << num + (modint)1 << "\n";
			ans *= t2[num];
		}
		else {
			if (i<le) {
				modint tonum = ri - le;
				ans *= (t2[num] + t2[tonum] - (modint)1);
				//ans *= (num + tonum+(modint)1);
				//cout << v[i].first << " " << v[i].second << " " << num + tonum+(modint)1 << "\n";

			}
		}
	}
	ans += c0 - 1;
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	solve();
	//stop
		return 0;
}

Measured memory_bytes: 16540