#include<cstdio>
#include<cstring>
#include<algorithm>

char a[36005][20];
char aux[20];
int x,n,i,k,sw;
int v[36005];

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

int main(){
	
	freopen("restante.in","r",stdin);
	freopen("restante.out","w",stdout);
	
	scanf("%d",&n);
	
	for(i=1;i<=n;i++){
		scanf("%s",a[i]);
		x=strlen(a[i]);
		std::sort(a[i],a[i]+x);
		v[i]=i;
	}
	
	std::sort(v+1,v+1+n,compr);
	
	if(strcmp(a[v[1]],a[v[2]])!=0) k++;
	if(strcmp(a[v[n-1]],a[v[n]])!=0) k++;
	
	for(i=2;i<n;i++)
		if(strcmp(a[v[i-1]],a[v[i]])!=0 && strcmp(a[v[i]],a[v[i+1]])!=0)
			k++;
	
	printf("%d",k);
	
	return 0;
	
}