#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int N,k,s=0,j;

struct cuv
{
    char v[17];
}a[36001];

int comp(cuv x,cuv y)
{
    return (strcmp(x.v,y.v)>=0);
}
int main()
{
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);
    scanf("%d",&N);
    for(int i=1;i<=N;++i)
    {
        scanf("%s",a[i].v);
        k=strlen(a[i].v);
        sort(a[i].v,a[i].v+k);
    }
    sort(a+1,a+N+1,comp);
    for(int i=2;i<=N;++i)
    {
        if(strcmp(a[i].v,a[i-1].v)==0)
        {
            ++s;
            j=1;
        }
        else
        {
            s=s+j;
            j=0;
        }
    }
    s=s+j;
    printf("%d",N-s);
    return 0;
}