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

#define int long long

const int M = 1e9+7;

int n,ans,r[300005];
double k[300005];

signed main()
{
	cin>>n;
	for(int i=1,a,b,c;i<=n&&cin>>a>>b>>c;i++)
		k[i] = (b!=0 ? -1.0*a/b : 2e17);
	sort(k+1,k+1+n);
	int now=1;
	for(int i=1;i<=n;i++)
	{
		if(i<now) continue;
		while(k[now]==k[i])
			r[i] = now, now++;
	}
	for(int i=1;i<=n;i++)
		if(r[i]>0)
			ans += (i-1)*(n-r[i])%M*(r[i]-i+1)%M, ans %= M;
	cout<<ans<<endl;
	
	return 0;
}