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

string v[36005];
int i,n,contor;

ifstream f("restante.in");
ofstream g("restante.out");

int main()
{
    f>>n;
	for(i=0;i<n;i++)
	{
        cin>>v[i];
        sort(v[i].begin(),v[i].end());
	}
	sort(v,v+n);
	for(i=1;i<n;i++)
	{
		if(v[i]!=v[i-1]) contor++;
		else {
			while(v[i]==v[i-1]) i++;
		}
	}
	if(v[n-1]!=v[n-2]) contor++;
    g<<contor;
	return 0;
}