#!/usr/bin/env python3
# O(N^2 log N) TLE
from fractions import Fraction
from bisect import bisect_left
n = int(input())
qs = [ [] for _ in range(3) ]
for i in range(n):
    p, a, b = map(int, input().split())
    qs[p] += [ Fraction(a, a+b) ]
for i in range(3):
    qs[i] += [ Fraction(1) ]
    qs[i].sort()
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]:
            qm = max(1 - qj, 1 - qk)
            qc = (1 - qj) + (1 - qk)
            if qc <= 1:
                lm = bisect_left(qs[i], qm)
                lc = bisect_left(qs[i], qc)
                cnt += len(qs[i]) - lm - (qs[i][lc] == qc)
assert cnt % 3 == 0
print(cnt // 3)