#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
char s[36010][20],sir[20];
int compare(const void *s1,const void *s2){
	return strcmp((char *)s1,(char *)s2);
}
int main(){
	freopen("restante.in","r",stdin);
	freopen("restante.out","w",stdout);
	int n=0,i,j,sol=0;
	fgets(sir,20,stdin);
	for(i=0;'0'<=sir[i] && sir[i]<='9';++i)
		n=n*10+sir[i]-'0';
	for(i=0;i<n;++i){
		fgets(sir,20,stdin);
		for(j=0;'a'<=sir[j] && sir[j]<='z';++j)
			s[i][j]=sir[j];
		sort(s[i],s[i]+j);
	}
	qsort(s,n,sizeof(s[0]),compare);
	for(i=1;i<n;++i){
		if(strcmp(s[i],s[i-1]) && strcmp(s[i],s[i+1]))
			++sol;
	}
	printf("%d\n",sol);
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}