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:
from pprint import pprint as pp
def GI(): return int(raw_input())
def GIS(): return map(int, raw_input().split())

def main():
    d = {}
    for t in xrange(GI()):
        k = tuple(sorted(GIS()))
        d[k] = d.get(k, 0) + 1
    return sum(v for v in d.itervalues() if v == 1)

print main()