#include <bits/stdc++.h>
#define int long long
using namespace std;

#define PII pair<int,int>
#define x first
#define y second
const int N = 300010, P = 1e9+7;

struct Node
{
	int p, q;
	void fun()
	{
		if(p == 0)
		{
			q = 0;
			return ;
		}
		int f = 1;
		if(p*q < 0)
			f = -1, p = max(p, -p), q = max(q, -q);
		int g = __gcd(p, q);
		p /= g, q /= g;
		p *= f;
		if(p<0 && q<0)
			p = -p, q = -q;
	}
};

int n, c1, c2, ans;
map <PII, int> mp;
int t[N], d1, d2;

signed main()
{
	cin >> n;
	for(int i=3; i<=n; i++)
		t[i] = (i-2)*(i-1)/2;
	for(int i=1,a,b,c; i<=n; i++)
	{
		cin >> a >> b >> c;
		Node x = {-a, b};
		x.fun();
		mp[{x.p, x.q}] ++;
		if(mp[{x.p, x.q}] == 1)
			c1 ++, d1 += t[c1];
		else
			c2 ++;
	}
	ans = d1;
	for(auto p:mp)
	{
		int x = p.second-1;
		if(x == 0)
			continue;
		ans += x * (t[c1] - d2 + P) % P;
		ans %= P;
		c1 += x;
		d2 += t[x+2];
		d2 %= P;
	}
	cout << ans;
	return 0;
}