#include<fstream.h>
#include<stdlib.h>
#include<string.h>
char m[36001][27];
int compar (const void *p, const void *q)
{ char x=*(char*)p, y=*(char*)q;
  if (x>y) return 1;
  if (x<y) return -1;
  return 0;
}

int main()
{
 ifstream  f1 ("restante.in");
 ofstream f2  ("restante.out");
 int n,i,j,k,f,id,nr=0;
 char c;
 f1>>n;
 for (i=1; i<=n; i++)
   {f1>>m[i];}
 for (i=1; i<=n; i++) qsort (m[i],strlen(m[i]), sizeof(m[i][1]), compar);
 qsort (m+1,n,sizeof(m[i]),compar);
 for (i=1; i<=n-1; i++)
   {
    id=i;
    while (strcmp(m[i],m[i+1])==0) i++;
     if (id==i)nr++;
    }
 if (strcmp(m[n-1],m[n]!=0) nr++;
 f2<<nr;
  return 0;
}