import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
q = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
v = set()
e = set()
f = set()
for i in range(q):
    a,b,c = map(int,input().split())
    v.add(a)
    v.add(b)
    v.add(c)
    e.add((a,b))
    e.add((b,c))
    e.add((a,c))
    f.add((a,b,c))
print(len(v) - len(e) + len(f))