#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
ifstream fin ("restante.in");
ofstream fout ("restante.out");
int N, sol;
string S[36010];

int main()
{
    fin >> N;
    for (int i = 1; i <= N; i++)
    {
        fin >> S[i];
        sort (S[i].begin(), S[i].end());
    }

    sort (S + 1, S + 1 + N);
    for (int i = 1; i <= N; i++) {
        if (S[i] != S[i-1] && S[i] != S[i+1]) sol++;
    }

    fout << sol << '\n';
    fout.close();
    return 0;
}