#include <bits/stdc++.h>
using namespace std;

char cuv[36005][20];
char key[36005][20];

int main() {
    ifstream fin("restante.in");
    ofstream fout("restante.out");

    int N;
    fin >> N;

    for(int i = 0; i < N; i++){
        fin >> cuv[i];

        strcpy(key[i], cuv[i]);
        sort(key[i], key[i] + strlen(key[i]));
    }

    // sortăm cheia
    sort(key, key + N, [](const char* a, const char* b) {
        return strcmp(a, b) < 0;
    });

    int originale = 0;

    for(int i = 0; i < N;) {
        int j = i + 1;

        while(j < N && strcmp(key[i], key[j]) == 0)
            j++;

        if(j - i == 1)
            originale++;

        i = j;
    }

    fout << originale;
    return 0;
}