#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct no
{char c[18];} s[36000];

int cmpc (const char &s1, const char &s2)
{return s1-'a'<=s2-'b';}

int cmp (const no &s1,const no &s2)
{if (strcmp(s1.c,s2.c)<0) return 0; return 1;}

int main()
{
	int n,m,i,sol=0,j;
	
	freopen("restante.in","r",stdin);
	freopen("restante.out","w",stdout);
	scanf("%d\n",&n);
	for (i=1;i<=n;++i)
	{
		scanf("%s\n",s[i].c);
		m=strlen(s[i].c);
		sort(s[i].c,s[i].c+m,cmpc);
	}
	sort(s+1,s+n+1,cmp);
	for (i=1;i<=n;++i)
		{for (j=i;j<n && strcmp(s[i].c,s[j+1].c)==0;++j);
		 if (!(j-i)) ++sol; else i=j;
		}
	printf("%d",sol);	
	
	return 0;}