Problem: You are given n triangles. 

You are required to find how many triangles are unique out of given triangles.
For each triangle you are given three integers a,b,c , the sides of a
triangle.

A triangle is said to be unique if there is no other triangle with same set of sides.

Note : It is always possible to form triangle with given sides.

INPUT:

First line contains n, the number of triangles. Each of next n lines contain
three integers a,b,c (sides of a triangle).

Output:

print single integer, the number of unique triangles.

Constraints:

1 ≤ n ≤ 10^5
1 ≤ a,b,c ≤ 10^15

SAMPLE INPUT
5
7 6 5
5 7 6
8 2 9
2 3 4
2 4 3 

SAMPLE OUTPUT
1

Explanation

only triangle with sides 8, 2, 9 is unique

Solution (in PYTHON):

Solution:
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
n = int(raw_input())
triangleMap = {}
for i in xrange(n):
	t = raw_input().split()
	if int(t[0])> int(t[1]): t[0],t[1] = t[1],t[0]
	if int(t[1])> int(t[2]): t[1],t[2] = t[2],t[1]
	if int(t[0])> int(t[1]): t[0],t[1] = t[1],t[0]
	m = ''.join(t)
	if m not in triangleMap: triangleMap[m] = 1
	else: triangleMap[m] += 1
solution = 0 
for v in triangleMap.values():
	if v == 1: solution += 1
print solution