from fractions import Fraction
from bisect import bisect_left

one = Fraction(1)

n = int(input())

ps = [[one], [one], [one]]

for _ in range(n):
    p, a, b = map(int, input().split())
    ps[p].append(Fraction(a, a + b))

p0, p1, p2 = sorted(map(sorted, ps), key=len)

p1len = len(p1)
p2len = len(p2)

ans = 0
for x in p0:
    for c in range(bisect_left(p1, one - x) , p1len):
        y = p1[c]
        i = bisect_left(p2, one - min(x, y))
        ans += p2len - i - 1
        if x != one - y:
            r = (one - x) + (one - y)
            j = bisect_left(p2, r, i)
            if p2[j] != r:
                ans += 1

print(ans)