#include <fstream>
#include <algorithm>
#include <iostream>
using namespace std;
string s,v[36005];
int main()
{
    int i,n,o=0;
ifstream f ("restante.in");
ofstream g ("restante.out");
f>>n;
for (i=1;i<=n;i++)
{
    f>>s;
    sort(s.begin(),s.end());
    v[i]=s;
}
sort (v+1,v+n+1);
if (v[1]!=v[2]) o++;
for (i=2;i<=n-1;i++)
    if (v[i]!=v[i-1] && v[i]!=v[i+1]) o++;
if (v[n]!=v[n-1]) o++;
g<<o;
}