#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define Nmax 36030

char sir[Nmax][17];
int N,so[Nmax],rez;
int cmp(int a,int b)
{
    if(strcmp(sir[a],sir[b])>0)
    return 1;
    return 0;
}
int main()
{
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);
    scanf("%d",&N);

    for(int i=1;i<=N;++i)
    {
    so[i]=i;
    scanf("%s",&sir[i]);
    sort(sir[i],sir[i]+strlen(sir[i]));
    }

    //    for(int i=1;i<=N;++i)
  //          printf("%s\n",sir[i]);

    sort(so+1,so+N+1,cmp);
    for(int i=1;i<=N;++i)
    {
       if(strcmp(sir[so[i]],sir[so[i-1]])!=0)
        if(strcmp(sir[so[i]],sir[so[i+1]])!=0)
            ++rez;
    }

    printf("%d",rez);

}