差点把我卡死………………
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i,l,r) for (int i=l; i<=r; i++)
#define ll long long
using namespace std;
const int N=3030;
const double Pi=acos(-1.);
int n,s,c[2][3],bl[N];
struct P{
int x,y,c,id; double k;
bool operator < ( const P &b ) const { return k < b.k; }
}p[N];
int main(){
scanf("%d",&n);
rep(i,1,n) scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].c),p[i].id=i;
P o; ll tmp,ans=0;
rep(i,1,n){
rep(j,1,n) if (p[j].id==i) { s=j; break; }
o=p[s]; int k=o.c;
rep(j,1,n){
p[j].k=(p[j].id!=i) ? atan2(p[j].y-o.y,p[j].x-o.x) : 1e9;
if (p[j].k<=0) p[j].k+=Pi;
}
sort(p+1,p+n+1); memset(c,0,sizeof(c));
rep(j,1,n-1)
if (p[j].y<o.y || (p[j].y==o.y && p[j].x>o.x))
c[bl[j]=0][p[j].c]++; else c[bl[j]=1][p[j].c]++;
rep(j,1,n-1){
c[bl[j]][p[j].c]--; tmp=1;
if (k) tmp*=c[0][0]; if (p[j].c) tmp*=c[1][0];
if (k^1) tmp*=c[0][1]; if (p[j].c^1) tmp*=c[1][1];
if (k^2) tmp*=c[0][2]; if (p[j].c^2) tmp*=c[1][2];
ans+=tmp; tmp=1;
if (k) tmp*=c[1][0]; if (p[j].c) tmp*=c[0][0];
if (k^1) tmp*=c[1][1]; if (p[j].c^1) tmp*=c[0][1];
if (k^2) tmp*=c[1][2]; if (p[j].c^2) tmp*=c[0][2];
ans+=tmp; c[bl[j]^=1][p[j].c]++;
}
}
printf("%lld\n",ans>>2);
return 0;
}