#include<fstream>

#include<algorithm>

#include<string.h>

using namespace std;

ifstream f("restante.in");

ofstream g("restante.out");

typedef char sir[25];

sir v[30010];

int i,n,nr,x[30010],tot,first,second;

bool cmp(int a,int b)

{

return (strcmp(v[a],v[b])<0);

}

int main()

{

f>>n;f.get();

for(i=1;i<=n;i++)

{

f.getline(v[i],25);

nr=strlen(v[i]);

sort(v[i],v[i]+nr);

x[i]=i;

}

sort(x+1,x+n+1,cmp);

if(strcmp(v[x[1]],v[x[2]])!=0) tot++;

if(strcmp(v[x[n]],v[x[n-1]])!=0) tot++;

for(i=2;i<n;i++)

{

first=strcmp(v[x[i-1]],v[x[i]]);

second=strcmp(v[x[i]],v[x[i+1]]);

if(strcmp(v[x[i-1]],v[x[i]])!=0 && strcmp(v[x[i]],v[x[i+1]])!=0)

{

tot++;

}

}

g<<tot;

}