#include <algorithm>
#include <string>

using namespace std;

#define MAX_N 36005
#define FIN "restante.in"
#define FOUT "restante.out"

int N, Res;
string S[MAX_N];

int main(void)
{
    int i;
    char word[32];

    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    scanf("%d", &N);
    for (i = 0; i < N; ++i) 
    {
        scanf("%s", word);
        S[i] = word;
        sort(S[i].begin(), S[i].end());
    }
    sort(S, S+N);

    for (i = 0; i < N; ++i)
    {
        if (i+1 < N && S[i] == S[i+1]) continue;
        if (i > 0 && S[i] == S[i-1]) continue;
        Res++;
    }
    printf("%d\n", Res);

    return 0;
}