#include <fstream>
#include <string>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

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

    int n;

    vector <string> a;

    fin >> n;

    while (n--) {
        string tmp;
        fin >> tmp;
        sort(tmp.begin(), tmp.end());
        a.push_back(tmp);
        fout << tmp << "\n";
    }

    sort(a.begin(), a.end());

    set<string> mul;

    for (int i = 0 ; i < (int)a.size(); ++i)
        mul.insert(a[i]);

    int ret = 0;

    for (int i = 0 ; i < (int)a.size(); ++i)
        if (mul.find(a[i]) == mul.end())
            ++ret;

    fout << ret;

    return 0;
}