#include<bits/stdc++.h>
using namespace std;


char a[36005][18];
int w[36005];
int n,l,sol;
inline bool cmp(int x,int y)
{
    return strcmp(a[x]+1,a[y]+1)<0;
}

int main()
{
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);

    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("\n");
        scanf("%s",a[i]+1);
        sort(a[i]+1,a[i]+strlen(a[i]+1)+1);
        w[i]=i;
    }
    sort(w+1,w+n+1,cmp);


    int l=1;
    for(int i=2;i<=n;i++)
    {
        if(!strcmp(a[w[i]]+1,a[w[i-1]]+1)) l++;
            else
        {
            if(l==1) sol++;
            l=1;
        }
    }

    if(l==1) sol++;

    printf("%d\n",sol);

    return 0;
}