#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define N 36005
using namespace std;
typedef char CUV[18];
CUV s[N];
int n,f[N];
int comp(const void *x,const void *y)
{
    if(strcmp(*(CUV*)x,*(CUV*)y)<0)
        return false;
    return true;
}
void read()
{
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%s",&s[i]);
        sort(s[i],s[i]+strlen(s[i]));
    }
    qsort(s,n+1,18*sizeof(char),comp);
}
void solve()
{
    int q=0;
    for(int i=1;i<=n;i++)
        if(strcmp(s[i],s[i-1])==0 || strcmp(s[i],s[i+1])==0)
            f[i]=1;
    for(int i=1;i<=n;i++)
        if(f[i]==0)
            q++;
    printf("%d",q);
}
int main()
{
    read();
    solve();
    return 0;
}