#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int i,j,ok,n,nr,k,i1;
char c[36001][20],s[36001],a;
int comp(int i1,int j1)
{ for(a=1;a<=16;a++) if(c[i1][a]!=c[j1][a]) return 1;
  return 0;
}
int main()
{ freopen("restante.in","r",stdin);
  freopen("restante.out","w",stdout);
  scanf("%d",&n);
  for(i=1;i<=n;i++) { scanf("%s",c[i]);
                      sort(c[i],c[i]+16); 
                    }
  for(i=1;i<=n;i++) { ok=0;
                      if(!s[i]) for(j=i+1;j<=n;j++)
                                      if(!s[j]) { k=comp(i,j);
                                                  if(k==0) { s[j]=1;
                                                             ok=1;
                                                           } 
                                               } 
                      if(ok==0&&!s[i]) nr++;
                    }
  printf("%d\n",nr);                                                                                               
  fclose(stdin);
  fclose(stdout);
  return 0;                  
}