#define _CRT_SECURE_NO_WARNINGS
//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
//#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ld EPS = 0.001;
const ld EPS2 = 1e-6;
const ld PI = acos(-1);
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int a228 = 18;
const int inf = 1e9;
const ll kekmod = 1791791791;
const ll bestmod = 1148822869;
#define int ll
ll gcd(ll a, ll b)
{
	while (b)
	{
		a %= b;
		swap(a, b);
	}
	return a;
}
const int mod = MOD7;
int mul(int a, int b)
{
	return a * b % mod;
}
int add(int a, int b)
{
	a += b;
	if (a >= mod)a -= mod;
	if (a < 0) a += mod;
	return a;
}
const int MAXN = 228228;
int binpow(int a, int b)
{
	int res = 1;
	while (b)
	{
		if (b & 1)
		{
			res = mul(res, a);
		}
		a = mul(a, a);
		b >>= 1;
	}
	return res;
}
int inv(int x)
{
	return binpow(x, mod - 2);
}
pair<pair<int, int>, bool> invv(pair<int, int> a)
{
	if (a == mp(1ll, 0ll))
	{
		return mp(mp(0ll, 1ll), 0);
	}
	if (a == mp(0ll, 1ll))
	{
		return mp(mp(1ll, 0ll), 0);
	}
	pair<pair<int, int>, bool> ta;
	a.first = -a.first;
	ta.first = { a.second,a.first };
	ta.second = (a.first < 0);
	ta.first = { abs(a.second), abs(a.first) };
	return ta;
}
pair<pair<int, int>, bool> tget(pair<int, int> a)
{
	pair<pair<int, int>, bool> ta;
	ta.first = a;
	ta.second = (ta.first.first < 0);
	ta.first = { abs(ta.first.first), abs(ta.first.second) };
	return ta;
}
int pss[MAXN];
signed main()
{
	fastio();
	map<pair<pair<ll, ll>, bool>, int> cnt;
	int n;
	cin >> n;
	vector<pair<int, int>> a(n);
	for (int i = 0; i < n; ++i)
	{
		cin >> a[i].first >> a[i].second;
	}
	pss[0] = 1;
	for (int i = 1; i < MAXN; ++i)
	{
		pss[i] = mul(pss[i - 1], 2);
	}
	pss[0] = 0;
	for (int i = 1; i < MAXN; ++i)
	{
		pss[i] = add(pss[i], -1);
	}
	ll amul = 1;
	ll ans = 0;
	for (int i = 0; i < n; ++i)
	{
		if (a[i].first == 0 && a[i].second == 0)
		{
			ans = add(ans, 1);
			continue;
		}
		if (a[i].first == 0) a[i].second = abs(a[i].second);
		if (a[i].second == 0) a[i].first = abs(a[i].first);
		int gg = gcd(abs(a[i].first), abs(a[i].second));
		a[i].first /= gg;
		a[i].second /= gg;
		bool f1 = (a[i].first < 0);
		bool f2 = (a[i].second < 0);
		a[i].first = abs(a[i].first);
		a[i].second = abs(a[i].second);
		if (f1 ^ f2)
		{
			a[i].first = -a[i].first;
		}
		auto ta = a[i];
		//		cout << 1 + cnt[{ {abs(a[i].first), abs(a[i].second)}, (a[i].first < 0)}] << endl;
		//		cout << inv(1 + cnt[{ {abs(a[i].first), abs(a[i].second)}, (a[i].first < 0)}]) << endl;
		//		cout << mul(amul, inv(1 + cnt[{ {abs(a[i].first), abs(a[i].second)}, (a[i].first < 0)}])) << endl;
		auto tkek = invv(ta);
		if (a[i].first == 0)
		{
			auto tamul = amul;
			tamul = mul(tamul, inv(1 + pss[cnt[tkek]] + pss[cnt[invv({tkek.first.first, tkek.first.second })]]));
			//	tamul = mul(tamul, inv(1 + cnt[{tkek.first, 1}] + cnt[invv({ -abs(tkek.first.first), tkek.first.second })]));
			tamul = mul(tamul, 1 + pss[cnt[tkek]]);
			ans = add(ans, tamul);
		}
		else
			ans = add(ans, mul(amul, mul(add(1, pss[cnt[tkek]]), inv(add(1, add(pss[cnt[tget(a[i])]], pss[cnt[tkek]]))))));
		//	a[i].first = -a[i].first;
		amul = mul(amul, inv(add(add(1, pss[cnt[tget(a[i])]]), pss[cnt[tkek]])));
		cnt[tkek]++;
		amul = mul(amul, (add(add(1, pss[cnt[tget(a[i])]]), pss[cnt[tkek]])));
	}
	cout << ans;
//	sp;
}

Measured memory_bytes: 38928