#include <iostream>
#include <fstream>
#include <unordered_map>
#include <algorithm>
using namespace std;

ifstream fin("restante.in");
ofstream fout("restante.out");
int n;
unordered_map<string, int> m;
string s;
int main()
{
	int cnt = 0;
	fin >> n;
	for (int i = 1; i <= n;i++)
	{
		fin >> s;
		sort(s.begin(), s.end());
		m[s]++;
	}
	for (auto w : m)
		if (w.second == 1)
			cnt++;
	fout << cnt;
	fin.close();
	fout.close();
	return 0;
}