#include<bits/stdc++.h>
#define ll   long long
#define mod   1000000007
const ll N=2e5;
using namespace std;
ll gcd(ll a,ll b){
	if(a==0){
		return b;
	}
	return b==0?a:gcd(b,a%b);
}
ll n,m;
map<pair<ll,ll>,ll> mp;
vector<pair<ll,ll> > v;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		ll a,b,c;
		bool _=0;
		cin>>a>>b>>c;
		if(b<0){
			_=!_;
			b=-b;
		}
		if(a<0){
			_=!_;
			a=-a;
		}
		ll g=gcd(a,b);
		a/=g;
		b/=g;
		if(_){
			a=-a;
		}
		if(!mp.count({a,b})){
			mp[{a,b}]=0;
			v.push_back({a,b});
		}
		mp[{a,b}]++;
	}
	__int128 ans=n*(n-1)/2*(n-2)/3%mod;
	for(auto i:v){
		__int128 x=mp[i];
		ans=((ans-x*(x-1)*(n-2)/2%mod+x*(x-1)*(x-2)/3%mod)%mod+mod)%mod;
	}
	cout<<(ll)ans;
	return 0;
}
//y=-a/b x-c/b