/*
容斥
总数-三条边平行-两条边平行
map统计每个斜率的条数。 
无重合，不用管c 
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = (int)1e9 + 7;
const int N = 3e5+9;
ll n,x,y,z,a[N], b[N];
map<pair<ll,ll>,ll>mp;
ll C3(ll x) {
    return x * (x - 1) / 2* (x - 2) / 3%mod;
}
ll gcd(ll a, ll b) {
    return b ? gcd(b, a % b) : a;
}


int main() {
    cin>>n;
    for (int i = 1; i <= n; ++i) {
        cin>>x>>y>>z; 
        
        if (x == 0)y=1;
        else if (y== 0)x = 2e9;
        else {
            ll d = gcd(x, y);
            x /= d;
            y /= d;
   		 }
        ++mp[ make_pair(x,y)];
    }

    ll ans = C3(n);
    for (auto it : mp) {
        ll cnt = it.second;
        if (cnt >= 2)
            ans -= cnt*(cnt-1)/2* (n - cnt) ;
        if (cnt >= 3)
            ans -= C3(cnt) ;
       // ans%= mod;
    }
    ans%=mod;
    ans=(ans+mod)%mod;
	cout<<ans<<"\n";
    return 0;
}