#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
const int mod = 1e9 + 7;
const int maxn = 3e5 + 10;
int a[maxn],b[maxn],c[maxn];
map<pii,int> mp;
int qpow(int x,int y)
{
	int ans = 1;
	while(y)
	{
		if(y & 1) ans = ans * x % mod;
		x = x * x % mod;
		y >>= 1;
	}
	return ans;
}
int jc[maxn],inv[maxn];
void init()
{
	jc[0] = 1;
	for(int i = 1;i <= 300000;i++) jc[i] = jc[i - 1] * i % mod;
	inv[300000] = qpow(jc[300000],mod - 2);
	for(int i = 300000 - 1;i >= 0;i--) inv[i] = inv[i + 1] * (i + 1) % mod;
	inv[0] = 1;
}
int C(int n,int m)
{
	if(n < m) return 0;
	return jc[n] * inv[m] % mod * inv[n - m] % mod;
}
signed main()
{
	init();
	int n;
	cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> a[i] >> b[i] >> c[i];
		mp[{a[i],b[i]}]++;
	}
	
	int minu = 0;
	for(auto it : mp)
	{
		minu += C(it.second,2);
		minu %= mod;
	}
	int cnt = 0;
	int ans = 0;
	for(int i = 1;i <= n;i++)
	{
		int x = a[i];
		int y = b[i];
		int ch = n - mp[{x,y}];
		int xx = minu - C(mp[{x,y}],2);
		ans = (ans + ((C(ch,2) + mod - xx) % mod) % mod) % mod;
	}
	ans = ans * qpow(3,mod - 2) % mod;
	cout << ans << endl;
	return 0;
}