#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

ifstream f ("restante.in");
ofstream g ("restante.out");

const int NMAX = 36000 + 1, LMAX = 16 + 1;
int n;
string v[NMAX];

void citeste () {
    f >> n;
    char *a;
    int l;
    for (int i = 1; i <= n; i++) {
        f >> v[i];
        a = &v[i][0];
        sort(a, a + v[i].length());
        v[i] = a;
    }
}

void rezolva() {
    int sol = 0;
    if (v[1] != v[2]) sol++;
    if (v[n - 1] != v[n]) sol++;
    for (int i = 2; i < n; i++)
        if (v[i] != v[i - 1] && v[i] != v[i + 1]) sol++;
    g << sol << '\n';
}


int main () {
    citeste();
    sort(v + 1, v + n + 1);
    rezolva();
    return 0;
}