#include<fstream>
#include<cstring>
#include<algorithm>
using namespace std;
int i,n,sol;
char v[20];
/*struct cod
{
    char c[21];
};
cod a[36001];
bool comp(cod a,cod b)
{
    if(strcmp(a.c,b.c)>0) return false;
    return true;
}*/
string a[36001];
int main()
{
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;++i)
    {
        gets(v);
        sort(v,v+strlen(v));
        a[i]=v;
    }
    sort(a+1,a+n+1);
    if(a[1]!=a[2])
        sol++;
    for(i=2;i<n;++i)
        if(a[i]!=a[i+1]&&a[i]!=a[i-1])
            ++sol;
    if(a[n]!=a[n-1])
        ++sol;
    printf("%d",sol);
    return 0;
}