#include <fstream>
#include <algorithm>
#include <cstring>

using namespace std;

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

int n,i,j;
long long cod[36005];
char ch[20];

int main()
{
    fin >> n;
    for (i=1; i<=n; i++)
    {
        fin >> ch+1;
        j = 1;
        while (ch[j] != 0)
            j++;
        int x = j;
        sort(ch+1, ch+x);
        for (j=1; j<=x-1; j++)
            cod[i] = cod[i]*10+(ch[j]-'a'+1);
    }
    sort(cod+1, cod+n+1);
    int sol = 0;
    for (i=1; i<=n; i++)
        if (cod[i] != cod[i-1] && cod[i] != cod[i+1])
            sol++;
    fout << sol;
    return 0;
}