#include<fstream>
#include<algorithm>
#define NMAX 36001
#define MMAX 18

using namespace std;

char a[NMAX][MMAX], b[MMAX];
int n, ind[NMAX], REZ=0;

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

bool cmp2(int x, int y)
{
	return (strcmp(a[x], a[y])<0);
}

void Citeste()
{
	int i, m;
	f>>n;
	f.get();
	for (i=0; i<n; ++i) 
	{
		f.getline(b, MMAX);
		m=strlen(b); ind[i]=i;
		sort(b, b+m);
		strcpy(a[i], b);
	}
}

void Solve()
{
	int nr=0, i;
	
	for (i=1; i<n; ++i)
		if (!strcmp(a[i-1], a[i])) ++nr;
		else 
		{
			if (nr==1) ++REZ;
			nr=1;
		}
	g<<REZ<<"\n";
}

int main()
{
	Citeste();
	
	sort(ind, ind+n, cmp2);
	
	Solve();
	
	f.close();
	g.close();
	return 0;
}