import std.algorithm, std.array, std.conv, std.stdio, std.typecons;

alias Vert = ulong;
alias Edge = Tuple!(Vert, Vert);
alias Face = Tuple!(Vert, Vert, Vert);

// lexicographical order
bool EdgeCmp(Edge l, Edge r) {
	return l[0] < r[0] || (l[0] == r[0] && l[1] < r[1]);
}
bool FaceCmp(Face l, Face r) {
	return l[0] < r[0] || (l[0] == r[0] && l[1] < r[1]) || (l[0] == r[0] && l[1] == r[1] && l[2] < r[2]);
}

void main() {
	auto Q = readln[0 .. $-1].to!ulong;
	Vert[] vertex_list;
	Edge[] edge_list;
	Face[] face_list;
	foreach (_; 0 .. Q) {
		auto ABC = readln.split.to!(Vert[]);
		auto A = ABC[0], B = ABC[1], C = ABC[2];
		
		vertex_list ~= [A, B, C];
		edge_list ~= [Edge(A, B), Edge(B, C), Edge(A, C)];
		face_list ~= Face(A, B, C);
	}
	
	auto v = vertex_list.sort.group.array.length;
	auto e = edge_list.sort!(EdgeCmp).group.array.length;
	auto f = face_list.sort!(FaceCmp).group.array.length;
	writeln(v - e + f);
}