#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
char s[36005][20];
int i,n,x[36005];
int cmp(int i,int j) {
	return (strcmp(s[i],s[j]) < 0);
}
int ct;
int main() {
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++) {
        scanf("%s",s[i]);
        x[i]=i;
        sort(s[i],s[i]+strlen(s[i]));
	}
    sort(x+1,x+n+1,cmp);
	if (strcmp(s[x[1]],s[x[2]])) ct++;
	if (strcmp(s[x[n-1]],s[x[n]])) ct++;
    for (i=2;i<n;i++) if (strcmp(s[x[i]],s[x[i-1]])&&strcmp(s[x[i]],s[x[i+1]])) ct++;
    printf("%d",ct);
	return 0;
}