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:
def count_triangles(D):
    count = 0
    for key in D.keys():
        if D[key] == 1:
            count += 1
    print(count)
    
def test():
    N= int(raw_input())
    counter =0
    D={}
    while counter <N:
        x =[int(x) for x in raw_input().split(' ')]
        x.sort()
        key = ''.join([str(m) for m in x])
        if key in D:
            D[key] +=1
        else:
            D[key]=1
            
        counter += 1

    count_triangles(D)

test()