#include <iostream>
#include <fstream>
#include <map>
#include <string>
#include <algorithm>

using namespace std;

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

int n, k;
string a;
map<string, int> fr;

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        fin >> a;
        sort(a.begin(), a.end());
        fr[a]++;
        if (fr[a]==1) k++;
        if (fr[a]==2) k--;
    }
    fout << k;
    return 0;
}