#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=3e5+10;
const int P=1e9+7;

struct Line 
{
	int al,bl,cl;
}x[N];

int fgcd(int a,int b)
{
	if(b==0)return a;
	return fgcd(b,a%b);
}

bool cmp(Line a,Line b)
{
	if(a.al==b.al)return a.bl>b.bl;
	return a.al>b.al;
}

int n,m,ans;
int s[N],h[N],a[N];

signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		int k=fgcd(a,b);
		a=a/k,b=b/k;
		x[i].al=a,x[i].bl=b,x[i].cl=c;
	}
	sort(x+1,x+n+1,cmp);
	for(int i=1;i<=n;i++)
	{
		if(x[i].al==x[i-1].al&&x[i].bl==x[i-1].bl)
			a[m]++;
		else
		{
			m++;
			a[m]++;
		}
	}
	for(int i=1;i<=m;i++)s[i]=s[i-1]+a[i];
	for(int i=m-1;i>1;i--)h[i]=(s[m]-s[i])*a[i]+h[i+1];
	for(int i=2;i<m;i++)ans=(ans+a[i-1]*h[i]+P)%P;
	cout<<(ans+P)%P<<endl;
	return 0;
}