#include <bits/stdc++.h>

using namespace std;

int n;
struct Cuvant
{
    char c[20];
};
Cuvant a[36003];

inline bool CMP(Cuvant A, Cuvant B)
{
  int i;
  i = 0;
  while(A.c[i] && B.c[i]){
    if(A.c[i] < B.c[i]) return true;
    i++;
  }
  return false;
}

int main()
{
    int i,x,sol;
    cin>>n;
    for(i = 1; i <= n; i++)
    {
        cin>>a[i].c;
        x = strlen(a[i].c);
        sort(a[i].c,a[i].c+x);
    }
    sort(a+1,a+n+1,CMP);

    sol = 0;
    for(i = 2; i <= n; i++)
        if(CMP(a[i],a[i-1]) == false)
          sol++;
    cout<<sol<<"\n";

    return 0;
}