using namespace std;

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <utility>
#include <functional>

#define pb push_back
#define f first
#define s second
#define sz size
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define C(v) C.erase( all(v) )
#define FORit(it,v) for(it = (v).begin();it != (v).end();++it)
#define mp make_pair

#define IN "puteri.in"
#define OUT "puteri.out"

int N,IMP[5][5],PAR[5][5];

typedef vector<int> VI;
typedef vector< vector <int> > VM;
typedef vector<string> VS;

II void scan()
{
	int x,y,z;
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	scanf("%d\n",&N);
	FOR(k,1,N)
	{
		scanf("%d%d%d\n",&x,&y,&z);
		if(x & 1)
			++IMP[1][1];
		else
			++PAR[1][1];
		if(y & 1)
			++IMP[1][2];
		else
			++PAR[1][2];
		if(z & 1)
			++IMP[1][3];
		else
			++PAR[1][3];
		
		if(x & 1 && y & 1)
			++IMP[2][1];
		if(!(x & 1) && !(y & 1));
			++PAR[2][1];
		if(x & 1 && z & 1)
			++IMP[2][2];
		if(!(x & 1) && !(z & 1));
			++PAR[2][2];
		if(y & 1 && z & 1)
			++IMP[2][3];
		if(!(y & 1) && !(z & 1));
			++PAR[2][3];
		
		if(x & 1 && y & 1 && z & 1)
			++IMP[3][1];
		if(!(x & 1) && !(y & 1) && !(z & 1))
			++PAR[3][1];
	}	
}

II void solve()
{
	ll rez( ((ll)N*((ll)N-1)) >> 1);
	
	rez -= (ll)PAR[1][1] * (ll)IMP[1][1];
	rez -= (ll)PAR[1][2] * (ll)IMP[1][2];
	rez -= (ll)PAR[1][3] * (ll)IMP[1][3];
	
	rez += (ll)PAR[2][1] * (ll)IMP[2][1];
	rez += (ll)PAR[2][2] * (ll)IMP[2][2];
	rez += (ll)PAR[2][3] * (ll)IMP[2][3];	
	
	rez -= (ll)PAR[3][1] * (ll)IMP[3][1];
	printf("%lld\n",rez);
}

int main()
{
	scan();
	solve();
	return 0;
}