#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 v[36011];
int cmp(int i,int j){
if(strcmp(a[i],a[j])<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]));
v[i]=i;
}
sort(v,v+n+1,cmp);
if(strcmp(a[1],a[2])!=0){nr++;}
for(i=2;i<=n-1;i++){
if(strcmp(a[i-1],a[i])!=0&&strcmp(a[i],a[i+1])!=0){
nr++;
}
if(strcmp(a[n-1],a[n])!=0){nr++;}
}
fprintf(fout,"%ld",nr);
return 0;}