#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

template <class T1, class T2>
ostream& operator << (ostream& out, const pair <T1, T2> p)
{
	out << '(' << p.first << ',' << p.second << ')';
	return out;
}

template <class T1, class T2>
istream& operator >> (istream& in, pair<T1, T2> &p)
{
	in >> p.first >> p.second;
	return in;
}

template <class T>
istream& operator >> (istream& in, vector<T> &v)
{
	for (T &x : v)
		in >> x;
	return in;
}

template <class T>
ostream& operator << (ostream& out, const vector<vector<T>> &v)
{
	for (const vector<T> &x : v)
		out << x << '\n';
	return out;
}

template <class T>
ostream& operator << (ostream& out, const vector<T> &v)
{
	for (const T &x : v)
		out << x << ' ';
	return out;
}

long long gcd (long long a, long long b)
{
	if (b > a)
		swap(a, b);
	return (b ? gcd(b, a % b) : a);
}

using ll   = long long;
using pii  = pair<int, int>;
using pll  = pair<long long, long long>;
using tiii = pair<pair<int, int>, int>;
using vi   = vector<int>;
using vl   = vector<long long>;
using vvi  = vector<vector<int>>;
using vvl  = vector<vector<long long>>;

#define F          first
#define S          second
#define First      first.first
#define Second     first.second
#define Third      second
#define mp         make_pair
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define per(i,b,a) for (int i = (b); i > (a); i--)
#define all(x)     x.begin(), x.end()
#define ret(x)     return cout << x, 0;
#define throwex    throw runtime_error ("Found the error.");

const int h = 1000000007;

namespace modexp
{
	const int mod = 1000000007;

	constexpr long long p (long long x, long long y)
	{
		long long ans = 1;
		while(y)
		{
			if(y & 1)
				(ans *= x) %= mod;
			(x *= x) %= mod;
			y /= 2;
		}
		return ans;
	}

	constexpr long long inv (const long long x)
	{
		return p (x, mod - 2);
	}
}
using modexp::p;
using modexp::inv;

signed main()
{
	ios::sync_with_stdio(false);
	#ifdef ONLINE_JUDGE
	cin.tie(nullptr);
	cout.tie(nullptr);
	cerr.setstate(ios::failbit);
	#endif

	int n;
	cin >> n;
	map<pair<ll, ll>, ll> m, mn;
	rep(i,0,n)
	{
		ll a, b;
		cin >> a >> b;
		if(a == 0)
			m[{0, 1}]++;
		else if(b == 0)
			mn[{1, 0}]++;
		else
		{
			ll g = gcd(abs(a), abs(b));
			a /= g;
			b /= g;
			if((a > 0 and b < 0) or (a < 0 and b > 0))
				mn[{abs(a), abs(b)}]++;
			else
				m[{abs(a), abs(b)}]++;
		}
	}
	ll ans = 1;
	for(auto x : m)
	{
		// cerr << x << ' ';
		ans *= (h - 1 + p(2, x.S) + p(2, (mn.count(mp(x.F.S, x.F.F)) ? mn[{x.F.S, x.F.F}] : 0LL)) ) % h;
		ans %= h;
		// cerr << ans << '\n';
	}
	for(auto x : mn)
	{
		if(m.count(mp(x.F.S, x.F.F)))
			continue;
		// cerr << x << ' ';
		ans *= p(2, x.S);
		ans %= h;
		// cerr << ans << '\n';
	}
	cout << (ans + h - 1) % h << '\n';
}
