Cod sursa(job #806785)
#include<fstream>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
using namespace std;
string a[36010];
int main()
{
freopen("resante.in","r",stdin);
freopen("restante.out","w",stdout);
int n,i,poz=0,sol=0;
char x[20];
scanf("%d\n",&n);
while(n--)
{
gets(x);
sort(x,x+strlen(x));
a[++poz]=x;
}
sort(a+1,a+poz+1);
poz-=1;
if(a[1]!=a[2])
sol++;
for(i=2;i<=poz;i++)
if(a[i]!=a[i-1] && a[i+1]!=a[i])
sol++;
if(a[poz+1]!=a[poz])
sol++;
printf("%d\n",sol);
return 0;
}