#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
struct cuv{
	int v;
	char s[20];
};
cuv x[36010];
int compara1(const void *a, const void *b)
{
    struct cuv *ia = (struct cuv *)a;
    struct cuv *ib = (struct cuv *)b;
    return strcmp(ia->s, ib->s);
} 

int compara2(const void *a, const void *b)
{
    const char *ia = (const char *)a; 
    const char *ib = (const char *)b;
    return *ia  - *ib; 
}
 
int main(){
	int i,n,cn,sol=0;
	freopen("restante.in","r",stdin);
	freopen("restante.out","w",stdout);
	scanf("%d\n",&n);
	cn=n;
	for(i=0;i<n;i++) {
		gets(x[i].s);
		x[i].v=strlen(x[i].s);
		qsort(x[i].s,x[i].v,sizeof(x[i].s[0]),compara2);
	}
    qsort(x,n,sizeof(x[0]),compara1);
	if (strcmp(x[0].s,x[1].s)!=0)
		++sol;
	if (strcmp(x[n-2].s,x[n-1].s)!=0)
		++sol;
	for (i=1;i<n-1;++i)
		if (strcmp(x[i-1].s,x[i].s)!=0 && strcmp(x[i].s,x[i+1].s)!=0)
			++sol;
	printf("%d",sol);
	return 0;
}