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

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

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);
	}
	
	do{
		
		sw=0;
		for(i=1;i<n;i++)
			if(strcmp(a[i],a[i+1])>0){
				strcpy(aux,a[i]);
				strcpy(a[i],a[i+1]);
				strcpy(a[i+1],aux);
				sw=1;
			}
		
		
	}while(sw);
	
	if(strcmp(a[1],a[2])!=0) k++;
	if(strcmp(a[n-1],a[n])!=0) k++;
	
	for(i=2;i<n;i++)
		if(strcmp(a[i-1],a[i])!=0 && strcmp(a[i],a[i+1])!=0)
			k++;
	
	printf("%d",k);
	
	return 0;
	
}