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

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

string s[36000];
int n;

void read()
{
	fin >> n;
	for (int i = 1; i <= n; i++)
	{
		fin >> s[i];
		sort(s[i].begin(), s[i].end());
	}
}
void sortFULL()
{
	for (int i = 1; i <= n; i++)
	{
		string g = "zzzz";
		int p = 0;
		for (int q = i; q <= n; q++)
			if (s[q] < g)
			{
				g = s[q];
				p = q;
			}
		swap(s[i], s[p]);
	}
}
int counting()
{
	int c = 0;
	for (int i = 1; i < n; i++)
		if (s[i] != s[i + 1])
			c++;
	return c;
}
int main()
{
	read();
	sortFULL();
	fout << counting();
}