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:
import sys; from collections import defaultdict
c = 0
d = defaultdict(lambda : 0)
n = int(sys.stdin.readline().strip('\n'))
for i in xrange(n):
    S = ' '.join(map(str,sorted([int(x) for x in sys.stdin.readline().strip('\n').split()])))
    d[S]+=1
for T in d:    
    if d[T] == 1 : c+=1
print c