#include <algorithm>
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
ifstream in("restante.in");
ofstream out("restante.out");
const int maxn = 36005;
string v[maxn];
char T[20];
int main()
{
    int n;
    in >> n;
    in.getline(T, 20);
    for(int i = 1; i <= n; i++)
    {
        in.getline(T, 20);
        int p = strlen(T);
        sort(T + 0, T + p);
        for(int j = 0; j < p; j++)
            v[i] += T[j];
    }
    sort(v + 1, v + n + 1);
    int dist = 0;
    for(int i = 2; i <= n; i++)
        if(v[i] != v[i - 1])
            dist++;
    out << dist;
    return 0;
}