#include <stdio.h>
#include <algorithm>
#include <string>

using namespace std;

#define maxn 30010
#define maxl 20

int n,sol;
string a[maxn];
char s[maxl];

int main()
{
	freopen("restante.in","r",stdin);
	freopen("restante.out","w",stdout);

	scanf("%d ",&n);

	int i,l;

	for (i=1;i<=n;i++)
	{
		scanf("%s ",s);
		l = strlen(s);
		sort(s,s+l);
		a[i] = string(s);
	}

	sort(a+1,a+n+1);

	for (i=1;i<=n;i++)
		if ((i==1 || a[i]!=a[i-1]) && (i==n || a[i]!=a[i+1])) sol++;

	printf("%d\n",sol);

	return 0;
}