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

using namespace std;
FILE*fin,*fout;
int n,i,j,ok,nr;
char a[36011][20];
int b[360011];
int cmp(int x, int y){
	if(strcmp(a[x],a[y])<0)
		 return 1;
	return 0;
	 
}
int main(){
fin=fopen("restante.in","r");
fout=fopen("restante.out","w");
fscanf(fin,"%d\n",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%s",a[i]);
sort(a[i],a[i]+strlen(a[i]));
b[i]=i;
}
sort(b,b+n+1,cmp);
nr=0;
if(strcmp(a[b[1]],a[b[2]])!=0)
	 nr=1;
for(i=2;i<n;i++)
	 if(strcmp(a[b[i]],a[b[i-1]])!=0&&strcmp(a[b[i]],a[b[i+1]])!=0)
		  nr++;
if(strcmp(a[b[n-1]],a[b[n]])!=0)
	 nr++;
fprintf(fout,"%d",nr);
	
return 0;}