#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

//#include"atcoder/all"


#ifdef _MSC_VER
#include <intrin.h>

#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
//using namespace atcoder;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;


long long gcd(long long x, long long y) {
	long long m = max(x, y), n = min(x, y);
	if (m%n == 0)return n;
	else return gcd(m%n, n);
}

bool mul_minus(int A, int B) {
	return (A < 0 && B>0) || (A > 0 && B < 0);
}
pii calc(int A, int B) {
	//if (A*B == 0)exit(1);
	int a = abs(A), b = abs(B);
	int g = gcd(a, b);
	if (!mul_minus(A,B)) {
		return { a / g,b / g };
	}
	else {
		return { -a / g,b / g };
	}
}
pii rev(pii p) {
	if (p.first < 0) {
		return{ p.second,-p.first };
	}
	else return{ -p.second,p.first };
}
const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
	mint operator+(const mint a) const { return mint(*this) += a; }
	mint operator-(const mint a) const { return mint(*this) -= a; }
	mint operator*(const mint a) const { return mint(*this) *= a; }
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const { return pow(mod - 2); }
	mint& operator/=(const mint a) { return *this *= a.inv(); }
	mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
void solve() {
	int N; cin >> N;
	vector<int>A(N), B(N);
	REP(i, N) {
		cin >> A[i] >> B[i];
	}
	int found = 0;
	map<pii, int>mpA, mpB;
	int a0 = 0, b0 = 0;
	//int ans = 0;
	REP(i, N) {
		if (A[i] == 0 && B[i] == 0) {
			found ++;
			//ans += i;
		}
		else if (A[i] == 0) {
			//ans += b0;
			a0++;
		}
		else if (B[i] == 0) {
			//ans += a0;
			b0++;
		}
		else {
			//ans += mpB[calc(-A[i], B[i])];
			mpA[calc(A[i], B[i])]++;
			mpB[calc(-B[i], A[i])]++;
		}
	}
	mint ans = 1;
	mint t = 2;
	ans *= (mint)(t.pow(a0) + t.pow(b0)-1);

	set<pii>done;
	for (auto x : mpA) {
		if (done.count(rev(x.first)))continue;
		int ca = x.second, cb = mpA[rev(x.first)];
		//DEBUG(ca); DEBUG(cb);
		ans *= ((mint)(t.pow(ca)+t.pow(cb)-1));
		done.insert(x.first);
		//ans *= (x.second + mpB[x.first]+1);
	}
	if (found)ans+=found;
	print((mint)(ans-1));
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	//int q;
	//cin >> q;
	//while (q--)
	solve();

}


Measured memory_bytes: 56236