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

int main()
{
    fin >> N;
    P[0] = 1;
    for (int i = 1; i <= 28; i++) {
        P[i] = P[i-1] * 2;
    }

    for (int i = 1; i <= N; i++)
    {
        fin >> S;
        for (int j = 0; j < S.size(); j++) {
            V[i] += P[S[j]-'a'+1];
        }
    }

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

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