#include <fstream>
#include <algorithm>
#include <unordered_map>
#include <cstring>

using namespace std;

ifstream fin ("restante.in");
ofstream fout ("restante.out");

int n, ans;

unordered_map <string, int> m;
string s;

int main()	{
	fin >> n;
	ans = n;
	for (int i = 1; i <= n; ++i)	{
		fin >> s;
		sort (s.begin(), s.end());
		++m[s];
		if (m[s] == 2)
			ans -= 2;
		else if (m[s] > 2)
			--ans;
	}
	fout << ans;
	return 0;
}