#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
using namespace std;


#define nmax 36010

char C[30];
string S[nmax];
int N, sol;


int main()
{
    freopen("restante.in", "r", stdin);
    freopen("restante.out", "w", stdout);
    int i;
    scanf("%i", &N);
    for(i = 0; i < N; i++) 
    {
          scanf("%s", C);
          S[i] = C;
          sort(S[i].begin(), S[i].end());
    }
    sort(S, S + N);
    sol = 0;
    for(i = 0; i < N; i++)
    {
          if(i + 1 < N && S[i] == S[i + 1]) continue;
          if(i - 1 >= 0 && S[i] == S[i - 1]) continue;
          sol ++;
    }
    printf("%i\n", sol);
    return 0;
}