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:
t = int(raw_input())
dc = {}
for i in range(0,t):
    a = raw_input()
    b = a.split(' ')
    x1 = int(b[0])
    x2 = int(b[1])
    x3 = int(b[2])
    x4 = "%s"%(x1+x2+x3)
    x5 = "%s"%(x1*x2*x3)
    x6 = [x4,x5]
    x7 = "-".join(x6)
    if (dc.has_key(x7)):
        dc[x7] = dc[x7] + 1
    else:
        dc[x7] = 1
ans = 0
for a,b in dc.items():
    if(b==1):
        ans = ans+1
print ans