#include<fstream>
#include<algorithm>
using namespace std;
int v[36005];
char a[36005][20];
int n;
int f(int i,int j)
{
  return strcmp(a[i],a[j])<0;
}
int main()
{
  ifstream fin("restante.in");
  ofstream fout("restante.out");
  fin>>n;
  int i;
  for(i=1;i<=n;i++)
   {
     fin>>a[i];
     sort(a[i],a[i]+strlen(a[i]));
     v[i]=i;
    }
   sort(v+1,v+n+1,f);
   int j=1;
   int rez=0;
   for(i=1;i<=n;i++)
   {
    j=i+1;
    while(strcmp(a[v[i]],a[v[j]])==0)
       j++;
    if(j-i==1)
      rez++;
    i=j-1;
    }
   fout<<rez;
   return 0;
}