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

using namespace std;

const char InFile[]="restante.in";
const char OutFile[]="restante.out";
const int MaxN=36111;

ifstream fin(InFile);
ofstream fout(OutFile);

int N,sol;
string S[MaxN];
bool ok[MaxN];

int main()
{
	fin>>N;
	for(register int i=1;i<=N;++i)
	{
		fin>>S[i];
		sort(S[i].begin(),S[i].end());
	}
	fin.close();
	
	sort(S+1,S+1+N);
	
	for(register int i=1;i<=N;++i)
	{
		if(S[i]==S[i-1])
		{
			ok[i]=false;
			ok[i-1]=false;
		}
		else
		{
			ok[i]=true;
		}
	}
	
	for(register int i=1;i<=N;++i)
	{
		if(ok[i])
		{
			++sol;
		}
	}
	
	fout<<sol;
	fout.close();
	return 0;
}