#include <fstream>
#include <string>
#include <algorithm>

using namespace std;

#define MaxN 36000

string s[MaxN];

int main(void) {
    ifstream in("restante.in");
    ofstream out("restante.out");
    int N, ptr;

    in >> N;
    for (int i = 0; i < N; i++) {
        in >> s[i];
        sort(s[i].begin(), s[i].end());
    }
    in.close();

    sort(s, s + N);

    int i = 0, ans = 0;
    do {
        ptr = i + 1;
        while (s[i] == s[ptr]) {
            ptr++;
        }
        ans += (ptr - 1 == i);
        i = ptr;
    } while (i < N);

    out << ans << '\n';
    out.close();
    return 0;
}