import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from random import sample

hh=list(sample(range(inf),300000))
enc={}
v=set()
e=set()
f=set()

for _ in range(II()):
    a,b,c=LI()
    if a not in enc:enc[a]=hh.pop()
    if b not in enc:enc[b]=hh.pop()
    if c not in enc:enc[c]=hh.pop()
    a=enc[a]
    b=enc[b]
    c=enc[c]
    v.add(a)
    v.add(b)
    v.add(c)
    e.add(a^b)
    e.add(b^c)
    e.add(c^a)
    f.add(a^b^c)

print(len(v)-len(e)+len(f))