#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int k,nr,i,n,b[36007];
char s[36007][17];
int cmp(int i,int j)
{
	if(strcmp(s[i],s[j])<0)
		return 1;
	return 0;
}
int main()
{
	freopen("restante.in","r",stdin);
	freopen("restante.out","w",stdin);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%s",s[i]);
		k=strlen(s[i]);
		b[i]=i;
		sort(s[i],s[i]+k);
	}
	sort(b+1,b+n+1,cmp);
	if(strcmp(s[b[1]],s[b[2]]))
		nr++;
	if(strcmp(s[b[n-1]],s[b[n]]))
		nr++;
	for(i=2;i<n;i++)
		if(strcmp(s[b[i]],s[b[i-1]])&&strcmp(s[b[i]],s[b[i+1]]))
			++nr;
	printf("%d\n",nr);
	return 0;
}