#include <fstream>
#include <string>
#include <algorithm>

const int MAX_N(36000);

int n, result;
std::string v [MAX_N];

inline void read (void)
{
	std::ifstream input("restante.in");
	input >> n;
	for (int index(0) ; index < n ; ++index)
	{
		input >> v[index];
		sort(v[index].begin(),v[index].end());
	}
	input.close();
}

inline void print (void)
{
	std::ofstream output("restante.out");
	output << result << '\n';
	output.close();
}

inline void compute (void)
{
	std::sort(v,v + n);
	int i(0), j;
	while (i < n)
	{
		for (j = i + 1 ; j < n ; ++j)
			if (v[j] != v[i])
				break;
		if (j < n && j == i + 1)
			++result;
		else if (i == n - 1)
			++result;
		i = j;
	}
}

int main (void)
{
	read();
	compute();
	print();
	return 0;
}