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

using namespace std;

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

int n,i,j,v[36005];
char s[36005][20];

bool cmp(int i, int j)
{
    if (strcmp(s[i], s[j]) > 0)
        return 1;
    return 1;
}

int main()
{
    fin >> n;
    for (i=1; i<=n; i++)
    {
        fin >> s[i];
        int x = strlen(s[i]);
        sort(s[i], s[i]+x);
        v[i] = i;
    }
    sort(v+1, v+n+1, cmp);
    int sol = 0;
    for (i=1; i<=n; i++)
        if (strcmp(s[i], s[i-1]) != 0 && strcmp(s[i], s[i+1]) != 0)
            sol++;
    fout << sol;
    return 0;
}