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:
n=int(raw_input())
a=[]
for i in xrange(n):
	a.append(raw_input().split(" "))
	a[i][0]=int(a[i][0])
	a[i][1]=int(a[i][1])
	a[i][2]=int(a[i][2])
	a[i].sort()

a.sort(key=lambda x: x[2])
a.sort(key=lambda x: x[1])
a.sort(key=lambda x: x[0])

cnt=0

if a[0]!=a[1]:
	cnt+=1

if a[n-2]!=a[n-1]:
	cnt+=1

for i in xrange(n-2):
	if (a[i+1]==a[i+2]) or (a[i]==a[i+1]) :
		None
	else:
		cnt+=1

print cnt