#include <fstream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
ifstream fi ("restante.in");
ofstream fo ("restante.out");
int i,n,v[40007],sol;
char s[40006][20];
int comp(int a,int b)
{
  return (strcmp(s[a],s[b])<=0);
}
int main()
{
    fi>>n;
    for (i=1;i<=n;i++) fi>>s[i];
    for (i=1;i<=n;i++) sort (s[i],s[i]+strlen(s[i]));
    for (i=1;i<=n;i++) v[i]=i;
    sort (v+1,v+n+1,comp);
    for (i=2;i<n;i++)
      if (strcmp(s[v[i]],s[v[i+1]])!=0 and strcmp(s[v[i]],s[v[i-1]])!=0) sol++;
    if (strcmp(s[v[1]],s[v[2]])!=0) sol++;
    if (strcmp(s[v[n-1]],s[v[n]])!=0) sol++;
    fo<<sol;
    return 0;
}