#!/usr/bin/env python3
# O(N^3)
from fractions import Fraction
n = int(input())
qs = [ [] for _ in range(3) ]
qs[0] += [ Fraction(1) ]
qs[1] += [ Fraction(1) ]
qs[2] += [ Fraction(1) ]
for i in range(n):
    p, a, b = map(int, input().split())
    qs[p] += [ Fraction(a, a+b) ]
cnt = 0
for i in range(3):
    j = (i + 1) % 3
    k = (i + 2) % 3
    for qj in qs[j]:
        for qk in qs[k]:
            qc = (1 - qj) + (1 - qk)
            qm = max(1 - qj, 1 - qk)
            if qc <= 1:
                cnt += len([ qi for qi in qs[i] if qi >= qm and qi != qc ])
assert cnt % 3 == 0
print(cnt // 3)