#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

#define dim 17
#define d 36000
char a[d][dim];
int v[d];
int n,i,k,m;
int check (char b[dim],char a[dim])
{ 
   // printf("%d %s %s\n",strcmp(a,b),a,b);
    if(strcmp(a,b)==0)
    return 0;
    return 1;
   
}
void read()
{
     scanf("%d",&n);
     gets(a[1]);
     for(i=1;i<=n;i++)
     {
                      gets(a[i]);
                      sort(a[i],a[i]+strlen(a[i]));
                   //   printf("%s\n",a[i]);
}}

void solve()
{
     for(i=1;i<=n;i++)
     {
                      for(k=i+1;k<=n;k++)
     {
                      if(check(a[i],a[k])==0)
                      {
                                          v[i]=v[k]=1;
                                          }
                                          }}
     int nr=0;
     for(i=1;i<=n;i++)
     if(v[i]==0)
     nr++;
     printf("%d",nr);
     return ;
     }
int main ()
{
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);
    read();
    solve();
    return 0;
}