#include<iostream.h>
#include<stdio.h>
#include<string.h>
FILE *f=fopen("restante.in","r"),*g=fopen("restante.out","w");
char a[36001][17];
void qsort(int st,int dr,char a[])
{
	int i=st,j=dr;
	char c=a[(st+dr)/2],c1;
	do
	{
		while(i<=j&&a[i]<c) i++;
		while(i<=j&&a[j]>c) j--;
		if(i<=j)
		{
			c1=a[i];a[i]=a[j];a[j]=c1;
			i++;j--;
		}
	}while(i<=j);
	if(i<dr) qsort(i,dr,a);
	if(j>st) qsort(st,j,a);
}
void qsort2(int st,int dr)
{
	int i=st,j=dr;
	char b[17];
	strcpy(b,a[(st+dr)/2]);
	do
	{
		while(i<=j&&strcmp(a[i],b)<0) i++;
		while(i<=j&&strcmp(a[j],b)>0) j--;
		if(i<=j)
		{
			char aux[17];
			strcpy(aux,a[i]);
			strcpy(a[i],a[j]);
			strcpy(a[j],aux);
			i++;j--;
		}
	}while(i<=j);
	if(i<dr) qsort2(i,dr);
	if(j>st) qsort2(st,j);
}
int main()
{
	int n,i,j,nr=0,t;
	fscanf(f,"%d\n",&n);
	for(i=1;i<=n;i++)
	{
		fscanf(f,"%s",&a[i]);
		qsort(0,strlen(a[i])-1,a[i]);
	}
	qsort2(1,n);
	i=1;
	while(i<=n)
	{
		if(strcmp(a[i],a[i+1])==0)
		{
			while(strcmp(a[i],a[i+1])==0) i++;
			i++;
		}
		else
			nr++,i++;
	}
	fprintf(g,"%d\n",nr);
	return 0;
}